[BZOJ3944]Sum(杜教筛)

最新推荐文章于 2020-09-19 00:25:36 发布

DSL_HN_2002

最新推荐文章于 2020-09-19 00:25:36 发布

阅读量232

点赞数

分类专栏：数论——杜教筛文章类型——题解

本文链接：https://blog.csdn.net/DSL_HN_2002/article/details/80221529

版权

文章类型——题解同时被 2 个专栏收录

57 篇文章 0 订阅

订阅专栏

数论——杜教筛

2 篇文章 0 订阅

订阅专栏

Description

给定一个正整数 $n$ ，求 $ans1=\sum_{i=1}^n\phi(i)$ ， $ans2=\sum_{i=1}^n\mu(i)$ 。

Solution

设 $S(n)=\sum_{i=1}^n\phi(i)$ ，
为 $S(n)$ 卷上一个恒等函数 $I(i)$ ，则

S (n) = \sum i = 1 n (ϕ \times I) (i) - \sum i = 2 n I (i) \times S (n i) = n \times ( n + 1 ) 2 - \sum i = 2 n S (n i)

$S(n)=\sum_{i=1}^n(\phi×I)(i)-\sum_{i=2}^nI(i)×S(\frac{n}{i})=\frac{n×(n+1)}{2}-\sum_{i=2}^{n}S({\frac{n}{i}})$

同理，设 $S(n)=\sum_{i=1}^n\mu(i)$
为 $S(n)$ 卷上一个恒等函数 $I(i)$ ，则

S (n) = \sum i = 1 n (μ \times I) (i) - \sum i = 2 n I (i) \times S (n i) = 1 - \sum i = 2 n S (n i)

$S(n)=\sum_{i=1}^n(\mu×I)(i)-\sum_{i=2}^nI(i)×S(\frac{n}{i})=1-\sum_{i=2}^{n}S({\frac{n}{i}})$

杜教筛即可。

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

typedef long long lint;
typedef unsigned int uint;
const int maxn = 5000005, N = 5000000;

bool vis[maxn];
int n, T, pr[maxn], pcnt;
lint miu[maxn], phi[maxn];

map<int, lint> mpi, mmu;

void prepare(int n = N)
{
    miu[1] = phi[1] = 1;
    for (int i = 2; i <= n; ++i) {
        if (!vis[i])
            pr[++pcnt] = i, miu[i] = -1, phi[i] = i - 1;
        for (int j = 1; j <= pcnt && i * pr[j] <= n; ++j) {
            vis[i * pr[j]] = 1;
            if (i % pr[j] == 0) {
                miu[i * pr[j]] = 0; phi[i * pr[j]] = phi[i] * pr[j];
                break;
            }
            miu[i * pr[j]] = -miu[i]; phi[i * pr[j]] = phi[i] * phi[pr[j]];
        }
    }
    for (int i = 1; i <= n; ++i) phi[i] += phi[i - 1], miu[i] += miu[i - 1];
}

lint mius(int n)
{
    if (n <= N) return miu[n];
    if (mmu.count(n)) return mmu[n];
    lint tmp = 1;
    for (uint i = 2, j; i <= n; i = j + 1) {
        j = n / (n / i);
        tmp -= (lint)mius(n / i) * (j - i + 1);
    }
    return mmu[n] = tmp;
}

lint phis(int n)
{
    if (n <= N) return phi[n];
    if (mpi.count(n)) return mpi[n];
    lint tmp;
    if (n & 1) tmp = (lint)(n + 1ll) / 2ll * n;
    else tmp = (lint)n / 2ll * (n + 1ll);
    for (uint i = 2, j; i <= n; i = j + 1) {
        j = n / (n / i);
        tmp -= (lint)phis(n / i) * (j - i + 1);
    }
    return mpi[n] = tmp;
}

int main()
{
    freopen("sum.in", "r", stdin);
    freopen("sum.out", "w", stdout);

    prepare();
    scanf("%d", &T);
    while (T--)
        scanf("%d", &n), printf("%lld %lld\n", phis(n), mius(n));

    return 0;
}