POJ 2407 Relatives（欧拉函数模板）

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 <iostream>
#include <cstdio>
#include <cstring>
using namespace std;

int euler(int n) {
    int rea=n;
    for(int i = 2;i*i <= n;i++) 
	{
        if(n%i == 0) 
		{
            rea = rea - rea/i;
            while(n%i==0) 
			{
				 n = n/i; 
			}
        }
    }
    if(n>1) 
	{
		 rea=rea-rea/n;
	}  
    return rea;
}
 
int main()
{
    int n;
    while(cin>>n) 
	{
    	if(n==0)break;
        int res = euler(n);
        printf("%d\n", res);
    }
    return 0;
}