HDU 1787GCD Again
来源:互联网 发布:.net域名代表什么 编辑:程序博客网 时间:2024/06/06 03:01
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
根号板子题
#include<set>#include<map>#include<ctime>#include<cmath>#include<stack>#include<queue>#include<bitset>#include<cstdio>#include<string>#include<cstring>#include<iostream>#include<algorithm>#include<functional>#define rep(i,j,k) for (int i = j; i <= k; i++)#define per(i,j,k) for (int i = j; i >= k; i--)#define loop(i,j,k) for (int i = j;i != -1; i = k[i])#define lson x << 1, l, mid#define rson x << 1 | 1, mid + 1, r#define ff first#define ss second#define mp(i,j) make_pair(i,j)#define pb push_back#define pii pair<int,LL>#define inone(x) scanf("%d", &x);#define intwo(x,y) scanf("%d%d", &x, &y);using namespace std;typedef unsigned long long LL;const int low(int x) { return x&-x; }const double eps = 1e-4;const int INF = 0x7FFFFFFF;const int mod = 1e9 + 7;const int N = 1e5 + 10;int n;int phi(int x){int res = 1;for (int i = 2; i*i <= x; i++){if (x % i) continue;res *= i - 1;x /= i;while (x%i == 0) res *= i, x /= i;}return res * max(x - 1, 1);}int main(){while (scanf("%d", &n), n){printf("%d\n", n - phi(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】 1787 GCD Again
- HDU 1787GCD Again
- hdu 1787 GCD Again 欧拉函数
- HDU 1787 GCD Again 欧拉函数
- GCD Again HDU杭电1787
- HDU 1787 GCD Again (欧拉函数)
- hdu 1918 GCD Again
- GCD Again HDU
- hdu 1787 GCD Again 欧拉函数小水水 数论
- HDU 1787 GCD Again 【欧拉函数模板】
- GCD Again HDU杭电1787【欧拉函数】
- HDU 1787 GCD Again (欧拉函数)
- HDU 1787 GCD Again (欧拉函数)
- 一道Integer面试题引发的对Integer的探究
- Android MD5 RSA DES等几种加密算法
- hive关系运算详解
- 操作实践总结
- sql server 2008 r2安装时的服务器配置。
- HDU 1787GCD Again
- Android应用性能优化系列视图篇——隐藏在资源图片中的内存杀手
- 表单向导中导出某张表
- 列关于java 中的 wait()方法和 sleep()方法的区别描述错误的是?
- 从oracle导入到MongoDB-csv乱码-MongoDB3.2.x
- 理解伪元素 :before 和 :after
- CSDN Markdown Learning
- HDU 2588 GCD
- 微信小程序开发(一)之Hello World!