hdu 数论+ 欧拉函数 1787
来源:互联网 发布:网络爬虫基本原理 编辑:程序博客网 时间:2024/06/04 18:20
题目来源:http://acm.hdu.edu.cn/showproblem.php?pid=1787
GCD Again
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 2239 Accepted Submission(s): 897
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
分析:
1:欧拉函数euler(n) 定义为 小于 n 又和 n 互素的正整数的个数。
n= p1^r1 * p2 ^r2 * …… * pk^rk
erler(n) = n (1- 1/p1) * (1 - 1/p2) * ……*(1- 1/pk)
= p1^(r1-1) * p2^(r2 -1) * ……* pk^(rk -1) * (p1 -1) *(p2-1) ……*(pk - 1)
2:则与n 不互素的个数为 n-1- erler(n)
代码如下:
#include<iostream>#include<stdlib.h>#include<stdio.h>#include<math.h>#include<string.h>#include<string>#include<queue>#include<algorithm>#include<map>using namespace std;// 欧拉函数int euler(int n){ int ans=1; int i; for(i=2;i*i <=n;i++) { if(n%i ==0) { ans*=i-1; n/=i; while(n%i ==0) { ans*=i; n/=i; } } } if(n!=1) // 最后一个因子为n!=1,保存 ans*=n-1; return ans;}int main(){ int n; while(scanf("%d",&n)&& n) { printf("%d\n", n-1 - euler(n)); } return 0;}
0 0
- hdu 数论+ 欧拉函数 1787
- hdu 1787 GCD Again 欧拉函数小水水 数论
- hdu 2588 GCD [欧拉函数]【数论】*
- HDU 2588 GCD [欧拉函数]【数论】
- HDU 2588 数论 欧拉函数
- 数论欧拉函数
- 欧拉函数(数论)
- 数论-欧拉函数
- 欧拉函数---数论
- hdu 4279Number(数论:推论+欧拉函数性质)
- HDU 4002 Find the maximum(数论-欧拉函数)
- HDU-4983-Goffi and GCD【数论】【欧拉函数】
- (hdu 2588 gcd)<数论—欧拉函数>
- HDU 5514 Frogs(欧拉函数+数论YY)
- HDU 3501 数论 欧拉函数的应用
- uva10820(数论 +欧拉函数)
- 数论之欧拉函数
- 欧拉函数(数论)
- 九度oj 1551 二分 + 精度
- 移动APP开发者近百万 推广费用高成功率不足1%
- hdu 1299 整数分解
- hdu 1452 因子和 + 逆元素+ 快速幂
- hdu 1215 数论 +打表
- hdu 数论+ 欧拉函数 1787
- hdu 2136 数论+筛选质数+打表
- hdu 1796 容斥原理
- hdu 1659 综合数论+ 筛选欧拉函数 +质因子 +容斥原理
- 关于C#中集合和数组(二)
- 关于C#中集合和数组(一)
- UVa 11185 - Ternary
- db2伪表sysibm.sysdummy1
- 我可以做的更好