当前你的浏览器版本过低,网站已在兼容模式下运行,兼容模式仅提供最小功能支持,网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器:

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

2478: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.
输入解释
There are several test cases. Each test case has only one line, which contains a positive integer n (2 <= n <= 106). There are no blank lines between cases. A line with a single 0 terminates the input.
输出解释
For each test case, you should output one line, which contains N(n) ---- the number of terms in the Farey sequence Fn.
输入样例
2
3
4
5
0
输出样例
1
3
5
9

该题目是Virtual Judge题目,来自 北京大学POJ

源链接: POJ-2478

最后修改于 2020-10-29T06:33:39+00:00 由爬虫自动更新

共提交 0

通过率 --%
时间上限 内存上限
1000 65536