NOIP模拟测试22

自   闭   赛 

从这次比赛之后题都好难啊QAQ

开考一小时内没动键盘。。。

三道题都不会。GG

Problem A：数论

过于玄学

枚举质因子，往答案里去加。用来加入的质因子不会很多，质因子大了对答案是不优的。

开两个vector来回倒腾就完了（（

这题改完感觉也没啥，为啥考场上就是想不出来啊QxQ

#include <bits/stdc++.h>

typedef long long LL;
int prime[63] = {0, 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53,
    59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131,
    137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199,
    211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281,
    283, 293};
int T, K;
LL M;
std::vector<std::pair<LL, LL>> a, b;

signed main() {
    scanf("%d%d%lld", &T, &K, &M);
    a.push_back(std::make_pair(1, 1));
    for (int i = 1; i <= 62; i++) {
        int pri = prime[i];
        //Add a prime factor.
        b.clear();
        for (auto x : a) {
            LL t = 1, cnt = 0;
            for (; x.first <= M / t && t <= M; t *= pri, ++cnt)
                b.push_back(std::make_pair(x.first * t, x.second * (cnt + 1)));
        }
        a.clear();
        std::sort(b.begin(), b.end());
        std::priority_queue<LL> q;
        //Delete the illegal numbers.
        for (auto x : b) {
            if (q.size() < (unsigned) K + 1) {
                q.push(-x.second);
                a.push_back(x);
            } else {
                if (-q.top() == x.second) {
                    a.push_back(x);
                } else if (-q.top() < x.second){
                    q.pop();
                    q.push(-x.second);
                    a.push_back(x);
                }
            }
        }
    }
    while (T--) {
        int n;
        scanf("%d", &n);
        printf("%lld
", a[n - 1].first);
    }
    return 0;
}

Problem B：位运算

咕咕咕

Problem C：旅行

咕咕咕