POJ-2478-Farey Sequence-递推求欧拉函数
来源:互联网 发布:c语言取反运算 编辑:程序博客网 时间:2024/05/22 12:44
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 <= 106). 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
提示:这是一道递推求欧拉函数的模板题
递推求欧拉函数的算法为
for(int a = 1; a <= maxn; a ++) i[a]=a; for(int a = 2; a<= maxn; a +=2) i[a]/=2; for(int a = 3; a<=maxn; a +=2) { if(i[a]==a) { for(int b =a; b <= maxn; b +=a) i[b]=i[b]/a*(a-1); } }
那么题解的代码如下
#include <cstdio>#define maxn 1000000long long i[1000005];int main(){ for(int a = 1; a <= maxn; a ++) i[a]=a; for(int a = 2; a<= maxn; a +=2) i[a]/=2; for(int a = 3; a<=maxn; a +=2) { if(i[a]==a) { for(int b =a; b <= maxn; b +=a) i[b]=i[b]/a*(a-1); } } for(int a = 3; a <= maxn; a ++) i[a]+=i[a-1]; int n; while(~scanf("%d",&n)&&n) printf("%lld\n",i[n]); return 0;}
- poj 2478 Farey Sequence(递推求欧拉函数)
- POJ-2478-Farey Sequence-递推求欧拉函数
- poj 2478 Farey Sequence (欧拉函数)
- poj 2478 Farey Sequence(欧拉函数)
- POJ 2478 Farey Sequence(欧拉函数)
- POJ 2478 : Farey Sequence - 欧拉函数
- poj 2478 Farey Sequence(欧拉函数)
- POJ 2478 Farey Sequence 欧拉函数 .
- POJ 2478 Farey Sequence 欧拉函数
- |poj 2478|欧拉函数|Farey Sequence
- POJ 2478 Farey Sequence(Farey数列&欧拉函数求和)
- poj 2478 Farey Sequence(欧拉函数)
- POJ - 2478 - Farey Sequence (欧拉函数)
- poj 2478 Farey Sequence(欧拉函数)
- POJ 2478 Farey Sequence(欧拉函数)
- POJ 2478-Farey Sequence(欧拉函数)
- poj 2478 Farey Sequence 欧拉函数递推打表
- POJ 2478 Farey Sequence 欧拉函数运用
- Linux(deepin)配置MySQL
- css实现小三角形
- nefu117 素数个数的位数 素数定理+位数公式
- 活动的生存周期
- Qes_20170801_Two components with the same name and precedence
- POJ-2478-Farey Sequence-递推求欧拉函数
- 基于STM32的GPS定位系统开发,以及Ucenter使用笔记
- 自定义波浪加载小球
- mysql实现物化视图详解及视图与物化视图区别
- Android异步消息处理线程机制
- 【单调栈】codeforces 280b
- ccf集合竞价
- vue.js基础-组件
- QT关于屏幕保护程序