hdu GCD Again(欧拉函数)
来源:互联网 发布:java产生随机数的代码 编辑:程序博客网 时间:2024/05/30 23:00
GCD Again
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2575 Accepted Submission(s): 1069
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
题目分析:
求取gccd>1的人,那么就是总人数减去欧拉函数求取的与n互质的人
求取gccd>1的人,那么就是总人数减去欧拉函数求取的与n互质的人
#include <iostream>#include <cstring>#include <cstdio>#include <algorithm>using namespace std;typedef long long LL;LL euler ( LL x ){ LL res = x; LL temp = x; for ( LL i = 2 ; i*i <= temp ; i++ ) { if ( x%i == 0 ) res -= res/i; while ( x%i == 0 ) x/=i; } if ( x > 1 ) res -= res/x; return res;}LL n;int main ( ){ while ( ~scanf ( "%lld" , &n ) , n ) printf ( "%lld\n" , n-1-euler(n) );}
0 0
- hdu 1787 GCD Again 欧拉函数
- HDU 1787 GCD Again 欧拉函数
- hdu GCD Again(欧拉函数)
- HDU 1787 GCD Again (欧拉函数)
- hdu 1787 GCD Again 欧拉函数小水水 数论
- HDU 1787 GCD Again 【欧拉函数模板】
- GCD Again HDU杭电1787【欧拉函数】
- HDU 1787 GCD Again (欧拉函数)
- HDU 1787 GCD Again (欧拉函数)
- hdu 1787 GCD Again (欧拉函数在线模板)
- GCD Again(欧拉函数)
- hdu1787 GCD Again(数论:欧拉函数)
- HDU1787 GCD Again【欧拉函数】
- HDOJ GCD Again 1787【欧拉函数】
- HDOJ-1787 GCD Again(欧拉函数)
- Relatives 和 GCD Again 【欧拉函数】
- HDU 1787 GCD Again/HDU 2824 The Euler function(欧拉函数模板)
- hdoj 1787 GCD Again(欧拉函数)
- mongodb分组去重
- 日拱一卒(四十三)
- 解释水波特效处理
- RFID:通信系统中为什么要进行编码和解码?常见的编码方式有哪些?
- 语义比较明确的属性
- hdu GCD Again(欧拉函数)
- nmap常用方法
- zoj1411_anniversary_dfs
- 视频教程网址
- 打包静态库
- Advice that can help you succeed on Campus
- Unity3d游戏安装包 极限减少之 四分图、二分图 (NGUI向)
- layout布局覆盖ActionBar
- 机器人开发仿真软件