POJ 2478 Farey Sequence

B - Farey Sequence

Time Limit:1000MS    Memory Limit:65536KB    64bit IO Format:%I64d & %I64u

Submit Status

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

---

欧拉函数打表，挨个相加。注意最后结果要用long long.

#include <stdio.h>
#define N 1000005
int phi[N];
void phi_table(int n)
{
    for(int i=2;i<=n;i++)phi[i]=0;
    phi[1]=1;
    for(int i=2;i<=n;i++)
        if(!phi[i])
            for(int j=i;j<=n;j+=i)
            {
                if(!phi[j])phi[j]=j;
                phi[j]=phi[j]/i*(i-1);
            }
}

int main()
{
        int n;
        phi_table(1000000);
        while(scanf("%d",&n)>0&&n)
        {
                long long sum=0;
                for(int i=2;i<=n;i++)
                        sum+=phi[i];
                printf("%I64d\n",sum);
        }
        return 0;
}