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.
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
题意:给定一个数n,求小于或等于n的数中两两互质组成的真分数的个数,其实就是求1到n中所有数的欧拉函数值的和,但是这并不需要每个数依次计算,刘汝佳的算法入门经典上有个类似筛法求素数的方法只有O(nloglogn)的复杂度。
代码:
#include<stdio.h> #include<string.h> int phi[1000005]; __int64 ans[1000005]; int i,j,n; void phi_table() { for(i=2;i<=1000005;i++) phi[i]=0; phi[1]=1; for(i=2;i<=1000005;i++) if(!phi[i]) for(j=i;j<=1000005;j+=i) { if(!phi[j]) phi[j]=j; phi[j]=phi[j]/i*(i-1); } } int main() { phi_table(); ans[1]=0; for(i=2;i<=1000005;i++) ans[i]=ans[i-1]+phi[i]; while(scanf("%d",&n),n) { printf("%I64d\n",ans[n]); } return 0; }