[BZOJ3944]Sum(杜教筛)

Description

给定一个正整数 n n ,求ans1=i=1nϕ(i) ans2=ni=1μ(i) a n s 2 = ∑ i = 1 n μ ( i )

Solution

S(n)=ni=1ϕ(i) S ( n ) = ∑ i = 1 n ϕ ( i )
S(n) S ( n ) 卷上一个恒等函数 I(i) I ( i ) ,则

S(n)=i=1n(ϕ×I)(i)i=2nI(i)×S(ni)=n×(n+1)2i=2nS(ni) S ( n ) = ∑ i = 1 n ( ϕ × I ) ( i ) − ∑ i = 2 n I ( i ) × S ( n i ) = n × ( n + 1 ) 2 − ∑ i = 2 n S ( n i )

同理,设 S(n)=ni=1μ(i) S ( n ) = ∑ i = 1 n μ ( i )
S(n) S ( n ) 卷上一个恒等函数 I(i) I ( i ) ,则

S(n)=i=1n(μ×I)(i)i=2nI(i)×S(ni)=1i=2nS(ni) S ( n ) = ∑ i = 1 n ( μ × I ) ( i ) − ∑ i = 2 n I ( i ) × S ( n i ) = 1 − ∑ i = 2 n S ( 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;
}
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值