Farey Sequence

http://poj.org/problem?id=2478 

求欧拉值的前n项和

 

 

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 <= 106). 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<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<map>
#define ll long long
using namespace std;
ll a[1000005];
void phi() {
      a[0] = 0;
      a[1] = 0;
      for (int i = 2; i < 1000005; i ++)
            a[i] = i;
      for (int i = 2; i < 1000005; i ++) {
            if(a[i] == i) {
                  for (int j = i; j < 1000005; j += i)
                        a[j] = a[j] - a[j] / i;
            }
      }
      // for (int i = 2; i < 100; i ++)
      //       printf("%lld\n", a[i]);
}
int main()
{
     int  t;
     a[1]=0;
     a[2]=1;
     a[3]=3;
     a[4]=5;
     phi();
     for (int i = 2; i < 1000005; i ++) {
           a[i] += a[i - 1];
     }
     while (cin>>t,t)  {
           printf("%lld\n", a[t]);
     }

    return 0;
}