Farey Sequence

                                                                                                          Farey Sequence

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 16270		Accepted: 6463

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

题意很好懂。

思路：欧拉函数

#include<stdio.h>
#include<string.h>
const int MAXN=1000010;
int dp[MAXN];
int main()
{
    memset(dp,0,sizeof(dp));
    dp[1]=1;
    for(int i=2; i<MAXN; i++)
    {
        if(dp[i])continue;
        for(int j=i; j<MAXN; j+=i)
        {
            if(!dp[j])dp[j]=j;
            dp[j]=dp[j]/i*(i-1);
        }
    }
    int N;
    while(~scanf("%d",&N)&&N)
    {
        long long int sum=0;
        for(int i=2;i<=N;i++)
            sum+=dp[i];
          printf("%lld\n",sum);
    }
    return 0;
}