poj2478

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. 

Sample Input

2
3
4
5
0

Sample Output

1
3
5
9

Source

POJ Contest,Author:Mathematica@ZSU

快速求欧拉函数。

代码如下：

#include<stdio.h>

int a[1000001];
int p[1000001];
long long f[1000001];

void euler(void) {
    for (int i = 1; i <= 1000000; i++) {
        a[i] = i;
        p[i] = 0;
    }
    for (int i = 2; i <= 1000000; i++) {
        if (p[i] == 0) {
            for (int j = i; j <= 1000000; j += i) {
                p[j] = 1;
                a[j] = a[j] / i * (i - 1);
            }
        }
    }
}

void plus(void) {
    euler();
    f[2] = 1;
    for (int i = 3; i <= 1000000; i++)
        f[i] = f[i - 1] + a[i];
}

int main(void) {
    int n;
    plus();
    while (scanf("%d", &n) && n) {
        printf("%lld\n", f[n]);
    }
    return 0;
}