GCD Again HDU杭电1787【欧拉函数】
来源:互联网 发布:卓越在线源码 编辑:程序博客网 时间:2024/05/09 02:56
Problem Description
Do you have spent some time to think and try to solve those unsolved problem after one ACM contest?
No? Oh, you must do this when you want to become a "Big Cattle".
Now you will find that this problem is so familiar:
The greatest common divisor GCD (a, b) of two positive integers a and b, sometimes written (a, b), is the largest divisor common to a and b. For example, (1, 2) =1, (12, 18) =6. (a, b) can be easily found by the Euclidean algorithm. Now I am considering a little more difficult problem:
Given an integer N, please count the number of the integers M (0<M<N) which satisfies (N,M)>1.
This is a simple version of problem “GCD” which you have done in a contest recently,so I name this problem “GCD Again”.If you cannot solve it still,please take a good think about your method of study.
Good Luck!
No? Oh, you must do this when you want to become a "Big Cattle".
Now you will find that this problem is so familiar:
The greatest common divisor GCD (a, b) of two positive integers a and b, sometimes written (a, b), is the largest divisor common to a and b. For example, (1, 2) =1, (12, 18) =6. (a, b) can be easily found by the Euclidean algorithm. Now I am considering a little more difficult problem:
Given an integer N, please count the number of the integers M (0<M<N) which satisfies (N,M)>1.
This is a simple version of problem “GCD” which you have done in a contest recently,so I name this problem “GCD Again”.If you cannot solve it still,please take a good think about your method of study.
Good Luck!
Input
Input contains multiple test cases. Each test case contains an integers N (1<N<100000000). A test case containing 0 terminates the input and this test case is not to be processed.
Output
For each integers N you should output the number of integers M in one line, and with one line of output for each line in input.
Sample Input
240
Sample Output
01
#include<stdio.h> int euler(int n) { int ans=n; int i; for(i=2;i*i<=n;i++) { if(n%i==0) { ans=ans/i*(i-1);//这里的i其实就是n的质数 while(n%i==0) { n/=i; } } } if(n>1) ans=ans/n*(n-1); //n已经为素数了 return ans; } int main() { int n; while(scanf("%d",&n),n) { printf("%d\n",n-1-euler(n)); } return 0;}
#include<stdio.h> int euler(int n) { int ans=1; int i; for(i=2;i*i<=n;i++) { if(n%i==0) { n/=i; ans*=i-1; while(n%i==0) { n/=i; ans*=i; } } } if(n>1) ans*=n-1; //n已经为素数了 return ans; } int main() { int n; while(scanf("%d",&n),n) { printf("%d\n",n-1-euler(n));}return 0;}
0 0
- GCD Again HDU杭电1787【欧拉函数】
- 【杭电oj】1787 - GCD Again(欧拉函数)
- 杭电1787GCD Again(欧拉函数)
- hdu 1787 GCD Again 欧拉函数
- HDU 1787 GCD Again 欧拉函数
- HDU 1787 GCD Again (欧拉函数)
- GCD Again(杭电oj1787)(欧拉函数)
- hdu GCD Again(欧拉函数)
- hdu 1787 GCD Again 欧拉函数小水水 数论
- HDU 1787 GCD Again 【欧拉函数模板】
- HDU 1787 GCD Again (欧拉函数)
- HDU 1787 GCD Again (欧拉函数)
- hdu 1787 GCD Again (欧拉函数在线模板)
- GCD Again HDU杭电1787
- HDOJ GCD Again 1787【欧拉函数】
- HDOJ-1787 GCD Again(欧拉函数)
- GCD HDU杭电2588 【欧拉函数的应用】
- HDU 1787 GCD Again/HDU 2824 The Euler function(欧拉函数模板)
- Android 怎么生成keystore文件
- Java容器类
- asp.net中对amCharts(.net版)图形报表的使用
- python 文件和路径操作函数小结
- nebula level14
- GCD Again HDU杭电1787【欧拉函数】
- 【BSGS求离散对数】HDU Mod Tree 2815
- 如何实现摄像全屏以及修改后的影响
- MAC上安装PIL(解决)
- jvm参数调优
- EasyUi 合并单元格占列显示
- iOS Group类型的table的height ForHeader与footer
- curl 预定义常量
- 分享酒店预订源码