poj 2478 Farey Sequence

Farey Sequence
Time Limit: 1000MSMemory Limit: 65536K
Total Submissions: 7298Accepted: 2724

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 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

Source

POJ Contest ,Author:Mathematica@ZSU
法拉雷数列:通过观察可以看出其实是NUM(Fn)=(phi(1)+phi(2)+phi(3)+……+phi(n));
也就是连续区间上的欧拉函数值求和;
对于这个问题欧拉函数的值总是要重复用到的所以我们希望一次求出1……n的phi(i);那么怎么样才能高效的求出呢?
通过欧拉函数的性质:


所以在进行线性时间筛法时我们就可以把欧拉函数值求出来;
通过一次求出前缀和便解决了问题;
代码如下:

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值