poj2407Relatives（欧拉函数）

Relatives

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 13024		Accepted: 6447

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<string.h>
#include<stdio.h>
#include<algorithm>
using namespace std;
int ac(int n)
{
	int res=n;
	int a=n;
	for(int i=2;i*i<=a;i++)
	{
		if(a%i==0)
		res=res/i*(i-1);
		while(a%i==0)
		a/=i;
	}
	if(a>1)
	return res/a*(a-1);
	return res;
}
int i,j,k,l,m,n;
int main()
{
	while(scanf("%d",&n),n)
	{
		int ans=ac(n);
		printf("%d\n",ans);
	}
}