POJ 2407 Relatives
2016-11-07 21:37
435 查看
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 13920 | Accepted: 6965 |
Given n, a positive integer, how many positive integers less than n are relatively prime to n? Two integers a and b are relatively prime if there are no integers x > 1, y > 0, z > 0 such that a = xy and b = xz.
Input
There are several test cases. For each test case, standard input contains a line with n <= 1,000,000,000. A line containing 0 follows the last case.
Output
For each test case there should be single line of output answering the question posed above.
Sample Input
7 12 0
Sample Output
6 4
Source
Waterloo local 2002.07.01
#include<cstdio> int euler_phi(int p){ int phi=p; for(int i=2;i*i<=p;i++){ if(!(p%i)){ phi=phi-phi/i; while(!(p%i)) p/=i; } } if(p>1) phi=phi-phi/p; return phi; } int main(){ int p; while(scanf("%d",&p),p) printf("%d\n",euler_phi(p)); return 0; }
裸的欧拉函数
相关文章推荐
- POJ - 2407 - Relatives(欧拉函数 + 约数个数定理)
- 【POJ 2407】Relatives(欧拉函数-水题)
- POJ 2407-Relatives-欧拉函数
- POJ 2407 Relatives
- POJ-2407 Relatives 欧拉phi函数
- poj 2407 Relatives 【容斥原理基础题】
- 数论 - 欧拉函数模板题 --- poj 2407 : Relatives
- POJ 2407 Relatives
- 【POJ 2407】 Relatives
- poj 2407 Relatives(简单欧拉函数)
- POJ-2407-Relatives 解题报告
- POJ 2407 Relatives 解题报告(欧拉函数水题)
- 欧拉函数 POJ 2407 Relatives&&POJ 2478 Farey Sequence
- poj 2407 Relatives
- POJ 2407 Relatives(欧拉函数)
- poj 2407 Relatives(欧拉函数模板题)
- 数学/欧拉函数/sgu 102 Coprimes/poj 2407 Relatives
- POJ_2407_Relatives(欧拉函数)
- (Relax 数论1.7)POJ 2407 Relatives(使用欧拉函数来求[1,n]中与n互质的整数的个数)
- POJ 2407Relatives