poj 2478 Farey Sequence

Farey Sequence

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 14278		Accepted: 5641

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.  

Sample Input

2
3
4
5
0

Sample Output

1
3
5
9

Source

POJ Contest,Author:Mathematica@ZSU

这道题本质上是一个欧拉函数；

欧拉函数+打表递推就可以解决这个问题；

#include<iostream>
#include<cstdlib>
#include<string>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<stack>
#include<queue>
#include<iomanip>
#include<map>
#include<set>
#define pi 3.14159265358979323846
using namespace std;
long long int ans[1000001];
long long int E[1000001];
int main()
{
    int n;
    for(int i=2;i<=1000000;++i)
    {
        if(!E[i])
        {
            for(int j=i;j<=1000000;j+=i)
            {
                if(!E[j])
                    E[j]=j;
                E[j]=E[j]/i*(i-1);
            }
        }
    }
    //cout<<E[1000000]<<endl;
    ans[2]=1;
    for(int i=3;i<=1000000;++i)
    {
        ans[i]=ans[i-1]+E[i];
    }
    while(scanf("%d",&n)!=EOF&&n)
    {
        printf("%lld\n",ans[n]);
    }
    return 0;
}