Relatives【POJ2407】

点击打开链接

Relatives

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 14835		Accepted: 7455

Description

Given n, a positive integer, how many positive integers less than n are relatively prime to n? Two integers a and b are relatively prime if there are no integers x > 1, y > 0, z > 0 such that a = xy and b = xz.

Input

There are several test cases. For each test case, standard input contains a line with n <= 1,000,000,000. A line containing 0 follows the last case.

Output

For each test case there should be single line of output answering the question posed above.

Sample Input

7
12
0

Sample Output

6
4

题解：用欧拉函数解决

#include<cstdio>
int eular(int n)
{
	int r=1,i;
	for(i=2;i*i<=n;i++){
		if(n%i==0){
			n/=i;
			r*=i-1;
			while(n%i==0){
			n/=i;
			r*=i;	
			}
		}
	}
	if(n>1){
			r*=n-1;
		}
	return r;
}
int main()
{
	int n;
	while(scanf("%d",&n),n){
		printf("%d\n",eular(n));
	}
	return 0;
}