题目:
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
一道直接运用欧拉公式就可以做出来的水题:
以下是ac代码:
#include<iostream>
using namespace std;
#define LL long long
LL sum[1000000+50]={0};LL ol[1000000+50]={0};
int main()
{
int k,n;
//欧拉函数打表
ol[1]=1;
for(int i=2;i<1000000+50;i++)
if(!ol[i])
for(int j=i;j<1000000+50;j+=i)
{
if(!ol[j]) ol[j]=j;
ol[j]=ol[j]/i*(i-1);
}
sum[2]=ol[2];
for(int i=3;i<1000000+50;i++)
{
sum[i]=sum[i-1]+ol[i];
}
while(cin>>n)
{
if(!n) break;
cout<<sum[n]<<endl;
}
return 0;
}