HDU 1787 GCD Again (欧拉函数)
来源:互联网 发布:无主之地2mac存档 编辑:程序博客网 时间:2024/05/17 22:05
GCD Again
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2920 Accepted Submission(s): 1260
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
Author
lcy
Source
2007省赛集训队练习赛(10)_以此感谢DOOMIII
Recommend
lcy | We have carefully selected several similar problems for you: 1788 1695 1573 2824 1286
题意:求小于N的与N互质的数的个数
思路:欧拉函数的应用。
#include<stdio.h>int euler(int n){int res=n,i;for(i=2;i*i<=n;i++){if(n%i==0)res=res/i*(i-1);while(n%i==0)n=n/i;//保证n一定是素数 } if(n>1) { res=res/n*(n-1); } return res;}int main(){int n;while(scanf("%d",&n),n){printf("%d\n",n-euler(n)-1);}return 0;}
0 0
- hdu 1787 GCD Again 欧拉函数
- HDU 1787 GCD Again 欧拉函数
- HDU 1787 GCD Again (欧拉函数)
- HDU 1787 GCD Again (欧拉函数)
- HDU 1787 GCD Again (欧拉函数)
- hdu GCD Again(欧拉函数)
- hdu 1787 GCD Again 欧拉函数小水水 数论
- HDU 1787 GCD Again 【欧拉函数模板】
- GCD Again HDU杭电1787【欧拉函数】
- hdu 1787 GCD Again (欧拉函数在线模板)
- HDOJ GCD Again 1787【欧拉函数】
- HDOJ-1787 GCD Again(欧拉函数)
- GCD Again(欧拉函数)
- hdoj 1787 GCD Again(欧拉函数)
- HDOJ 题目1787 GCD Again(欧拉函数)
- HDOJ 1787 GCD Again(欧拉函数)
- HDOJ 1787 GCD Again (欧拉函数)
- hdoj GCD Again 1787 (欧拉函数)
- Linux内核的整体架构
- 线程池初学
- 素数求和
- 理清ThinkPHP的目录结构及访问规则,创建第一个控制器
- nyoj 2 括号配对 栈
- HDU 1787 GCD Again (欧拉函数)
- 完全背包问题
- 单体模式
- 香烟(烟屁股可以做烟)
- 2016长乐夏令营 Day9
- S3C2440A地址空间
- HDU 1348 Wall 标准凸包 Graham-Scan算法
- 第十三章 Cameras
- VECTOR