HDU 1787 GCD Again
2016-06-12 19:33
441 查看
GCD Again
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2876 Accepted Submission(s): 1240
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!
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
2
4
0
Sample Output
0
1
AC代码:
#include<stdio.h> #include<math.h> int Euler(int x) { int i,s=1; for(i=2;i*i<=x;i++) { if(x%i==0) { x/=i; s*=i-1; while(x%i==0) { x/=i; s*=i; } } } if(x>1) s*=x-1; return s; } int main() { int t; while(scanf("%d",&t),t) { printf("%d\n",t-1-Euler(t)); } return 0; }
相关文章推荐
- [Hadoop]Hadoop Training Roadmap
- SICP 习题2.17 last-pair 找出表的最后一个值
- hdfs.DFSClient: Failed to close file 解决办法
- svn cleanup failed–previous operation has not finished 解决方法
- solution Of 1106. Lowest Price in Supply Chain (25)
- mybaits中#和$的区别
- aircrack-ng工具学习记录(一)
- Coping with the TCP TIME-WAIT state on busy Linux servers
- TIME-WAIT 快速回收
- Golang import、init()、main()
- “不支持一个STA线程上针对多个句柄的WaitAll。”的解决方案
- keystone uwsgi failed
- 谷歌 DeepMind 计划 5 年内将人工智能用于健康领域
- ASM 翻译系列第一弹:基础知识 ASM AU,Extents,Mirroring 和 Failgroups
- saltstack--grains
- 联想小新air13触摸屏失灵
- OpenStack Liberty High Availability 概述和指导-第二部分
- 如何在AIX上安装axis2c
- iredmail安装
- IntelliJ IDEA(或者JetBrains PyCharm)中弹出“IntelliJ IDEA License Activation”时怎么办