HYSBZ 3944 Sum

最新推荐文章于 2019-08-08 22:51:54 发布

X_rotator

最新推荐文章于 2019-08-08 22:51:54 发布

阅读量409

点赞数

分类专栏：题解文章标签： BZOJ 杜教筛

本文链接：https://blog.csdn.net/X_rotator/article/details/69946673

版权

题解专栏收录该内容

19 篇文章 0 订阅

订阅专栏

HYSBZ 3944 Sum

题目描述：

输入正整数 $N \ (N \leq 2^{31} - 1)$ ，求 $\sum_{i=1}^N \psi(i)$ 和 $\sum_{i=1}^N \mu(i)$ 。

题解：

杜教筛模板题。

以欧拉函数为例：

\sum i = 1 N \sum d ∣ i ψ (d) = \sum i = 1 N (ψ \times 1) (i) = N \cdot ( N + 1 ) 2

$\sum_{i=1}^N \sum_{d \mid i} \psi(d) = \sum_{i=1}^N (\psi \times 1)(i) = \frac{N \cdot (N + 1)}{2}$
令

F(x) $F(x)$ 表示

∑xi=1ψ(i) $\sum_{i=1}^x \psi(i)$ ，那么又有

\sum i = 1 N \sum d ∣ i ψ (d) = \sum i d = 1 N \sum d = 1 N i d ψ (d) = \sum k = 1 N \sum d = 1 ⌊ N k ⌋ ψ (d) = \sum k = 1 N F (⌊ N k ⌋)

$\sum_{i=1}^N \sum_{d \mid i} \psi(d) = \sum_{\frac{i}{d}=1}^N \sum_{d=1}^{\frac{N}{\frac{i}{d}}} \psi(d) = \sum_{k=1}^N \sum_{d = 1}^{\lfloor \frac{N}{k} \rfloor} \psi(d) = \sum_{k=1}^N F(\lfloor \frac{N}{k} \rfloor)$
所以

F (N) = N \cdot ( N + 1 ) 2 - \sum i = 2 N F (⌊ N k ⌋)

$F(N) = \frac{N \cdot (N + 1)}{2} - \sum_{i=2}^N F(\lfloor \frac{N}{k} \rfloor)$
预处理出前

MAXN23 $MAXN^{\frac{2}{3}}$ 的答案，然后记忆化搜索即可。对于莫比乌斯函数的推到同理。

题目链接： vjudge 原网站

代码：


#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
using namespace std;

#define MAXN 5000007
#define MAXP MAXN / 10
#define MAXM 200007

static int T, pr_tot, prime[MAXP];
static bool npr[MAXN], vis_phi[MAXM], vis_mu[MAXM];
static long long N;
static long long phi[MAXN], mu[MAXN], mem_phi[MAXM], mem_mu[MAXM];

long long solve_phi(long long x)
{
    if (x < MAXN) return phi[x];
    if (vis_phi[N / x]) return mem_phi[N / x];
    long long ans = (x + 1) * x / 2;
    for (long long i = 2, last; i <= x; i = last + 1)
    {
        last = x / (x / i);
        ans -= (last - i + 1) * solve_phi(x / i);
    }
    return vis_phi[N / x] = 1, mem_phi[N / x] = ans;
}

long long solve_mu(long long x)
{
    if (x < MAXN) return mu[x];
    if (vis_mu[N / x]) return mem_mu[N / x];
    long long ans = 1;
    for (long long i = 2, last; i <= x; i = last + 1)
    {
        last = x / (x / i);
        ans -= (last - i + 1) * solve_mu(x / i);
    }
    return vis_mu[N / x] = 1, mem_mu[N / x] = ans;
}


int main()
{
    phi[1] = mu[1] = 1;
    for (int i = 2; i < MAXN; i++)
    {
        if (!npr[i])
            prime[pr_tot++] = i, phi[i] = i - 1, mu[i] = -1;
        for (int j = 0; j < pr_tot && (long long)i * prime[j] < MAXN; j++)
        {
            npr[i * prime[j]] = 1;
            if (i % prime[j])
            {
                phi[i * prime[j]] = phi[i] * (prime[j] - 1);
                mu[i * prime[j]] = -mu[i];
            }
            else
            {
                phi[i * prime[j]] = phi[i] * prime[j];
                mu[i * prime[j]] = 0;
                break;
            }
        }
    }
    for (int i = 1; i < MAXN; i++)
        phi[i] += phi[i-1], mu[i] += mu[i-1];
    for (scanf("%d", &T); T; T--)
    {
        scanf("%lld", &N);
        memset(vis_phi, 0, sizeof(vis_phi));
        memset(vis_mu, 0, sizeof(vis_mu));
        printf("%lld %lld\n", solve_phi(N), solve_mu(N));
    }
    return 0;
}

提交记录（AC / Total = 1 / 6）：

Run ID	Remote Run ID	Time(ms)	Memory(kb)	Result	Submit Time
8729112	1988730	4608	80512	RE	2017-04-10 10:44:56
8729334	1988859	4972	102388	RE	2017-04-10 11:41:49
8729349	1988883	11104	80644	TLE	2017-04-10 11:47:29
8729386	1988918	0	174116	MLE	2017-04-10 12:01:50
8729427	1988928	548	89300	WA	2017-04-10 12:10:43
8729435	1988930	10964	89300	AC	2017-04-10 12:13:44