Farey Sequence

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

题解：欧拉公式真是奇妙，自己也是看了这个博客才懂，理解了一番，详细看代码。

https://blog.csdn.net/u014733623/article/details/24022179

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int d[1000010];
long long mp[1000010];
void lin()
{
    for(int i=2; i<1000001; i++)//欧拉公式，计算比j小且和j互斥的数的个数
    {
        if(d[i]==0)//如果是素数
        {
            for(int j=i; j<1000001; j+=i)//所有能整除i的j，在下面公式中先运算，最后可以运算完满足j的素数
            {
                if(d[j]==0)
                    d[j]=j;
                d[j]=d[j]/i*(i-1);
            }
        }
    }
    for(int i=2; i<1000001; i++)
        mp[i]=mp[i-1]+d[i];
}
int main()
{
    lin();
    int n;
    while(~scanf("%d",&n)&&n)
    {
        printf("%lld\n",mp[n]);
    }
    return 0;
}