欧拉函数 POJ - 2478

Farey Sequence

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 17846		Accepted: 7153

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

题意：找出1到n里面有多少对互质的数。

欧拉函数模板题。预处理n的所有欧拉函数。

#include <cstdio>
#include <iostream>
#include <string>
#include <cstring>
#include <map>
#include <vector>
#include <cstdlib>
#include <cmath>

using namespace std;

const int N = 1000000+100;
int phi[1000000+100];
int prime[N];

void euler()
{
    int tot=0;
    phi[1] = 1;
    for(int i = 2; i < N; i++) {
        if(!phi[i]) {
            phi[i] = i-1;
            prime[tot++] = i;
        }
        for(int j = 0; j < tot && 1ll*i*prime[j] < N; j++) {
            if(i%prime[j]) phi[i*prime[j]] = phi[i]*(prime[j]-1);
            else {
                phi[i*prime[j]] = phi[i]*prime[j];
                break;
            }
        }
    }
}

int main()
{
    euler();
    int n;
    while(scanf("%d", &n) && n) {
        long long ans=0;
        for(int i = 2; i <= n; i++) ans+=phi[i];
        cout << ans << endl;
    }

    return 0;
}