poj2407 Relatives

Language: Default Relatives Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 12254   Accepted: 5981 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的与n互质的数的个数
//f(1)=1;f(n)=n*(1-1/a1)*(1-1/a2)*(1-1/a3)****(1-1/an)[a1……an为n的因子] 
#include<cstdio>
int main()
{
	int n,sum;
	while(scanf("%d",&n)&&n)
	{
		sum=n;
		for(int i=2;i*i<=n;++i)
		{
			if(n%i==0)
			{
				sum=sum/i*(i-1);
			}
			while(n%i==0)
				n=n/i;
		}
		if(n!=1)
		{
			sum=sum/n*(n-1);
		}
		printf("%d\n",sum);
	}
	return 0;
}