FZU 1012 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.

题意：

统计有多少个n的相对素数，也就是与n互质的个数，然后用欧拉函数公式

欧拉函数

下面是欧拉函数的模板：

ll eular(ll n)
{
    ll ans=n;
    for(int i=2;i*i<=n;++i)
    {
        if(n%i==0)
        {
            ans=ans/i*(i-1);//先除法运算可以防止溢出
            while(n%i==0)
            	n/=i;//将n中的素因子i除尽，然后再找下一个素因子
        }
    }
    if(n>1)ans=ans/n*(n-1);
    如果n>1,说明还没有除尽所有的素因子,所以还要再套用一次公式
    return ans;
}

题目代码

#include<cstdio>
#include<algorithm>
using namespace std;
typedef long long ll;
ll eular(ll n)
{
    ll ans=n;
    for(int i=2;i*i<=n;++i)
    {
        if(n%i==0)
        {
            ans=ans/i*(i-1);
            while(n%i==0)
            	n/=i;
        }
    }
    if(n>1)ans=ans/n*(n-1);
    return ans;
}
int main()
{
	ll n;
	while(scanf("%lld",&n),n)
		printf("%lld\n",eular(n));
	return 0;
}