洛谷P4213(杜教筛）

最新推荐文章于 2022-11-11 12:42:19 发布

Dillonh

最新推荐文章于 2022-11-11 12:42:19 发布

阅读量213

点赞数

分类专栏：迷之数论

本文链接：https://blog.csdn.net/Dillonh/article/details/90702671

版权

迷之数论专栏收录该内容

14 篇文章 0 订阅

订阅专栏

#include <bits/stdc++.h>
using namespace std;
typedef long long LL;

const int maxn = 3e6 + 3;
int t, n, cnt;
bool v[maxn];
short mu[maxn];
int isp[maxn], phi[maxn];
LL sum1[maxn];
int sum2[maxn];
unordered_map<int,LL> dp1;
unordered_map<int,int> dp2;

void init() {
    mu[1] = phi[1] = 1;
    for(int i = 2; i < maxn; ++i) {
        if(!v[i]) {
            v[i] = 1;
            mu[i] = -1;
            phi[i] = i - 1;
            isp[cnt++] = i;
        }
        for(int j = 0; j < cnt && i * isp[j] < maxn; ++j) {
            v[i*isp[j]] = 1;
            mu[i*isp[j]] = -mu[i];
            if(i % isp[j] == 0) {
                mu[i*isp[j]] = 0;
                phi[i*isp[j]] = phi[i] * isp[j];
                break;
            }
            phi[i*isp[j]] = phi[i] * (isp[j] - 1);
        }
    }
    for(int i = 1; i < maxn; ++i) sum1[i] = sum1[i-1] + phi[i], sum2[i] = sum2[i-1] + mu[i];
}

LL getnum1(int x) {
    if(x < maxn) return sum1[x];
    if(dp1[x]) return dp1[x];
    LL ans = 1LL * x * (x + 1) / 2;
    for(int l = 2, r; l <= x; l = r + 1) {
        r = x / (x / l);
        ans = ans - 1LL * (r - l + 1) * getnum1(x/l);
    }
    return dp1[x] = ans;
}

LL getnum2(int x) {
    if(x < maxn) return sum2[x];
    if(dp2[x]) return dp2[x];
    LL ans = 1;
    for(int l = 2, r; l <= x; l = r + 1) {
        r = x / (x / l);
        ans = ans - 1LL * (r - l + 1) * getnum2(x/l);
    }
    return dp2[x] = ans;
}

int main() {
    init();
    scanf("%d", &t);
    while(t--) {
        scanf("%d", &n);
        printf("%lld %lld\n", getnum1(n), getnum2(n));
    }
    return 0;
}