POJ 2407 Relatives(欧拉函数)

Relatives

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 12422		Accepted: 6043

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

欧拉函数:

欧拉函数p(n)指不超过n且与n互素的正整数的个数，其中,n是一个正整数,欧拉函数的性质:它在整数n上的值等于对n进行素因子分解后，所有的素数幂上的欧拉函数之积。

题目大意:

给出一个正整数n,小于n且和n互素的正整数有多少个?

解题思路:

直接运用欧拉函数模版即可.

AC代码:

#include<iostream>

using namespace std;

int phi(int n)
{
	int rea = n;
	for(int i=2;i * i <= n;i++)
	{
		if(n % i == 0)
		{
			rea = rea - rea / i;
			do
			n /= i;
			while(n % i == 0);
		}
	}	
	if(n > 1)
	{
		rea = rea - rea / n;
	}
	return rea;
}

int main()
{
	int m;
	while(scanf("%d",&m) != EOF && m)
	{
		int res = phi(m);
		printf("%d\n",res);
	}
}