hdu GCD Again(欧拉函数)
2015-04-14 23:33
501 查看
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!
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
Author
lcy
题目分析:
求取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) ); }
相关文章推荐
- (hdu step 7.2.2)GCD Again(欧拉函数的简单应用——求[1,n)中与n不互质的元素的个数)
- hdu 1787 GCD Again 欧拉函数小水水 数论
- HDU 1787 GCD Again/HDU 2824 The Euler function(欧拉函数模板)
- GCD Again HDU - 1787 (欧拉函数 or 容斥原理)
- hdu 1787 GCD Again 欧拉函数
- HDU 1787 GCD Again(欧拉函数,水题)
- HDU 1787 GCD Again (欧拉函数)
- (hdu step 7.2.2)GCD Again(欧拉函数的简单应用——求[1,n)中与n不互质的元素的个数)
- hdu 1787 GCD Again (欧拉函数)
- 【hdu - 1787 GCD Again (数论、欧拉函数)】
- HDU 1787 GCD Again 欧拉函数
- HDU 1787 GCD Again (欧拉函数)
- hdu 2588 GCD(欧拉函数)
- HDOJ---1787 GCD Again[欧拉函数的延伸]
- HDU 1787 GCD Again
- hdu 2588 gcd 欧拉函数
- HDU 2588 NOJ 1126 GCD 欧拉函数应用问题
- hdoj 1787 GCD Again(欧拉函数)
- hdu 1695 GCD (欧拉函数、容斥原理)
- hdu1787 GCD Again(数论:欧拉函数)