HDU 1787 GCD Again
来源:互联网 发布:cad网络机柜 交换机 编辑:程序博客网 时间:2024/06/04 18:23
GCD Again
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2876 Accepted Submission(s): 1240
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
AC代码:
#include<stdio.h>#include<math.h>int Euler(int x){int i,s=1;for(i=2;i*i<=x;i++){if(x%i==0){x/=i;s*=i-1;while(x%i==0){ x/=i; s*=i;}}}if(x>1) s*=x-1;return s;}int main(){int t;while(scanf("%d",&t),t){printf("%d\n",t-1-Euler(t)); }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 (欧拉函数)
- Bootstrap表单按钮图标
- MongoDB与Hadoop技术栈的整合应用
- 内核编译 之 使用kernel-package编译内核imgage包
- 【GDOI2014模拟】网格 题解+代码
- Bootstrap网格系统
- HDU 1787 GCD Again
- Bootstrap菜单导航
- ie中的radio click()不能触发radio的change事件
- 斯坦福cs224d(深度学习在自然语言处理上的应用)Lecture 2
- Java(代码块)
- jquery的each循环问题
- C++中virtual与inline Debug与Release选项 const 与 #define
- mongodb 不重复添加数组方法
- 交叉编译dbus模块到Qt 遇到的错误及解决