POJ 2478 Farey Sequence 解题报告（欧拉函数筛求法）

最新推荐文章于 2025-01-25 09:19:32 发布

原创最新推荐文章于 2025-01-25 09:19:32 发布 · 801 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#欧拉函数

ACM 同时被 2 个专栏收录

224 篇文章

订阅专栏

数学

96 篇文章

订阅专栏

本文介绍了一种使用类似素数筛法求解欧拉函数的方法，以计算Farey序列中项的数量。通过预处理得到每个数的欧拉函数值，并累计求和，最终输出指定范围内Farey序列的项数。

Farey Sequence

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 11555		Accepted: 4492

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

解题报告：用类似于素数筛的求法求欧拉函数。代码如下：

#include <cmath>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

const int maxn=1000010;
bool h[maxn];
int epi[maxn];
long long sum[maxn];

void calEpi()
{
    for(int i=2;i<maxn;i++)
    {
        if(!h[i]) for(int j=i;j<maxn;j+=i)
        {
            if(epi[j]==0) epi[j]=j;
            epi[j]=epi[j]/i*(i-1);
            h[j]=true;
        }

        sum[i]=sum[i-1]+epi[i];
    }
}

int main()
{
    calEpi();

    int n;
    while(~scanf("%d", &n) && n)
    {
        printf("%lld\n", sum[n]);
    }
}