POJ2487Farey Sequence(欧拉函数&&法雷级数)

最新推荐文章于 2020-07-17 07:59:37 发布

猪猪奋斗记

最新推荐文章于 2020-07-17 07:59:37 发布

阅读量837

点赞数

分类专栏：数学

本文链接：https://blog.csdn.net/bigbigship/article/details/36652447

版权

数学专栏收录该内容

119 篇文章 0 订阅

订阅专栏

题目链接：http://poj.org/problem?id=2478

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

Sample Output

题目要求是求出Fn的元素个数，由法雷级数的定义可知

Fn 是由一系列的不能约分的分数a/b（0<a<b<=n&&gcd(a,b)=1）按递增顺序排列组合而成

因此我们很容易的就可以知道第N项的元素个数为 2,3.。。。。n的欧拉函数值的和

#include <iostream>
#include <cstdio>
using namespace std;
typedef long long LL;
const int N = 1000001;
LL oular[N];
void phi()
{
    for(int i=1;i<N;i++)   oular[i]=i;
    for(int i=2;i<N;i+=2)   oular[i]/=2;
    for(int i=3;i<N;i+=2){
        if(oular[i]==i){
            for(int j=i;j<N;j+=i)
                oular[j]=oular[j]/i*(i-1);
        }
    }
    for(int i=3;i<N;i++)
        oular[i]+=oular[i-1];
}
int main()
{
    phi();
    int n;
    while(~scanf("%d",&n)&&n){
        printf("%I64d\n",oular[n]);
    }
    return 0;
}