POJ 2478 Farey Sequence

Description
The Farey Sequence Fn for any integer n with n >= 2 is the set of irreducible rational numbers a/b with 0 < a < b <= n and gcd(a,b) = 1 arranged in increasing order. The first few are
F2 = {1/2}
F3 = {1/3, 1/2, 2/3}
F4 = {1/4, 1/3, 1/2, 2/3, 3/4}
F5 = {1/5, 1/4, 1/3, 2/5, 1/2, 3/5, 2/3, 3/4, 4/5}
You task is to calculate the number of terms in the Farey sequence Fn.

---

【题目分析】
题目的意思翻译过来，就是求欧拉函数的值，可以先用线性筛预处理出来，然后一一读入输出就可以了。

---

【代码】

#include <cstdio>
long long phi[1000001],pri[1000001],top=0;
inline void init()
{

    for (int i=2;i<=1000000;++i)
    {
        if (!phi[i]) pri[++top]=i,phi[i]=i-1;
        for (int j=1;j<=top&&pri[j]*i<=1000000;++j)
        {
            if (i%pri[j]==0) {phi[i*pri[j]]=phi[i]*pri[j];break;}
            else phi[i*pri[j]]=phi[i]*(pri[j]-1);
        }
    }
}
int main()
{
    init();
    for (int i=2;i<=1000000;++i)
        phi[i]+=phi[i-1];
    int x;
    while (scanf("%d",&x)&&x)
        printf("%lld\n",phi[x]);
    return 0;
}