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.

Input

There are several test cases. Each test case has only one line, which contains a positive integer n (2 <= n <= 10  ⁶). There are no blank lines between cases. A line with a single 0 terminates the input.

Output

For each test case, you should output one line, which contains N(n) ---- the number of terms in the Farey sequence Fn. 

2
3
4
5
0

Sample Output

1

3

5

9

题意是说求出n内所有互质的数，比如给出n，i<n,求与i互质的数的个数Si，需要的结果是S2+S3+....+Sn,就是n个欧拉函数值相加，这里普通求法会超时，需要用筛法求欧拉函数值来做。

对于筛法求欧拉函数值，请看大牛网站http://blog.csdn.net/hqd_acm/article/details/5397909，讲解很清晰。

代码如下：

#include<iostream>
#include<string.h>
using namespace std;
int phi[1000100],prime[1000100];
void s()
{
    prime[0]=prime[1]=0;
     for(int i=2;i*i<=1000000;i++)
     {
        if(prime[i])
         {
            for(int j=i*i;j<=1000000;j+=i)
             {
                 prime[j]=0;
             }
         }
     }
}
void oula()
{
    for(int i=1;i<=1000000;i++)
     {
         phi[i]=i;
     }
    for(int i=2;i<=1000000;i++)
     {
        if(prime[i])
         {
            for(int j=i;j<=1000000;j+=i)
             {
                 phi[j]=phi[j]/i*(i-1);    //此处注意先/i再*（i-1)，否则范围较大时会溢出
             }
         }
     }
}
int main()
{
    int m;
    __int64 num;
    memset(prime,1,sizeof(prime));
    s();
    oula();
    while(cin>>m&&m!=0)
    {
        num=0;
        for(int i=2;i<=m;i++)
            num+=phi[i];
        cout<<num<<endl;
    }
    return 0;
}