POJ2478 Farey Sequence

Farey Sequence Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 15250   Accepted: 6058 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 6). 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

其实题意就是让你找出n及小于n的数的互质数共有多少对，直接求欧拉函数之和。

在这里1的欧拉函数是1，但从题面看来是不需要统计这个1/1的。

AC代码：

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<string>
#include<vector>
#include<stack>
#include<bitset>
#include<cstdlib>
#include<cmath>
#include<set>
#include<list>
#include<deque>
#include<map>
#include<queue>
using namespace std;
typedef long long ll;
const double PI = acos(-1.0);
const double eps = 1e-6;
const int INF = 1000000000;
const int maxn = 1000010;
int T,n,m;
int table[maxn];
void phi_table()
{
	for(int i=2;i<=1000001;i++) table[i]=0;
	table[1]=1;
	for(int i=2;i<=1000001;i++) if(!table[i]){
		for(int j=i;j<=1000001;j+=i){
			if(!table[j]) table[j]=j;
			table[j]=table[j]/i*(i-1);
		}
	}
}
int main() {
	phi_table();
    while(~scanf("%d",&n)&&n!=0) {
    	long long sum=0;
		for(int i=2;i<=n;i++){
			sum+=table[i];
		}
		printf("%lld\n",sum);
    }
    return 0;
}