hdoj1787GCD Again【欧拉函数】

 

GCD Again Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2666    Accepted Submission(s): 1120 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

题意：求满足GCD（N，M）>1的数M的个数及计算与N不互质的数的个数

#include<cstdio>
#include<cstdlib>
#include<cstring>
using namespace std;
int Eular(int n){
	int ret=1,i;
	for(i=2;i*i<=n;++i){
		if(n%i==0){
			n/=i;ret*=i-1;
			while(n%i==0){
				n/=i;ret*=i;
			}
		}
	}
	if(n>1)ret*=n-1;
	return ret;
}
int main()
{
	int t,n,i,j;
	while(scanf("%d",&n),n){
		printf("%d\n",n-Eular(n)-1);
	}
	return 0;
}