http://poj.org/problem?id=2407
欧拉函数模版题
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
Source Code:
#include <iostream>
#include<cmath>
#define ll long long
using namespace std;
ll Euler(ll x)
{
ll res=x;
for(ll i=2;i<=sqrt(x);i++)
{
if(x%i==0)
{
res=res/i*(i-1);
while(x%i==0)
x/=i;
}
}
if(x>1)
res=res/x*(x-1);
return res;
}
int main()
{
ll n,ans;
while(cin>>n&&n)
{
ans=Euler(n);
cout<<ans<<endl;
}
return 0;
}