Relatives（欧拉函数，求互质）

Relatives

Time Limit:1000MS     Memory Limit:65536KB     64bit IO Format:%lld & %llu

Submit  Status

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

欧拉函数，求小于n的互质因子的个数

#include<stdio.h>
int zi(int x)
{
	int rex=x;
	for(int i=2;i*i<=x;i++)
	{
		if(x%i==0)
		rex=rex/i*(i-1);//将i的倍数全部取出
		while(x%i==0)
		x=x/i;
		
	}
	if(x>1)
	rex=rex/x*(x-1);
	
	return rex;
}
int main()
{
	int t,n;

	while(scanf("%d",&t),t)
	{
		
		printf("%d\n",zi(t));
	}
}