POJ2407 Relatives 【欧拉函数模板】

https://vjudge.net/problem/POJ-2407

Relatives

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 14310		Accepted: 7151

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<iostream>
#include<cstring>
using namespace std;
int euler(int n)
{
    int i,ans=n;
    for(i=2; i*i<=n; i++)
        if(n%i==0)
        {
            ans=ans-ans/i;
            while(n%i==0)
                n/=i;//把该素因子全部约掉
        }
    if(n>1)
        ans=ans-ans/n;
    return ans;
}
int main()
{
    int n;
    while(cin>>n&&n)
        cout<<euler(n)<<endl;
    return 0;
}