POJ - 2478_Farey Sequence_线性筛求欧拉函数值

题意

给定一个 n，求用不大于 n 的数中能找出多少对互素的数。

思路

欧拉函数前缀和

链接

https://cn.vjudge.net/contest/176263#problem/E

代码

#include<cstdio>
#include<iostream>
#include<cstring>

using namespace std;

typedef long long LL;

const int maxn = 1e6 + 10;

int n;
int phi[maxn];
int prime[maxn], it;
LL sum[maxn];

void phi_sieve(int N)
{
    phi[1] = 1;
    for(int i= 2; i<= N; i++)
    {
        if(prime[i] == 0) prime[it ++] = i, phi[i] = i - 1;

        for(int j= 0; j< it && prime[j] * i <= N; j++)
        {
            prime[prime[j] * i] = 1;
            if(i % prime[j] == 0)
            {
                phi[prime[j] * i] = phi[i] * prime[j];
                break;
            }
            else phi[prime[j] * i] = phi[i] * (prime[j] - 1);
        }
    }
}

void init()
{
    phi_sieve(maxn - 10);

    sum[1] = 0;
    for(int i= 2; i<= maxn - 10; i++)
        sum[i] = sum[i - 1] + phi[i];
}

int main()
{
    //freopen("in.txt", "r", stdin);

    init();

    while(scanf("%d", &n) != EOF)
    {
        if(n == 0) break;

        cout << sum[n] << endl;
    }

    return 0;
}