uva-10299-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.

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.

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

 

基本欧拉函数的应用，注意n==1时直接输出0

代码：

 

#include<iostream>
#include<string>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<iomanip>
#include<queue>
#include<cstring>
#include<map>
using namespace std;
typedef long long ll;
#define M 1000000005

int a;
int euler_phi(int n)
{
    int m=(int)sqrt(n+0.5);
    int ans=n;
    for(int i=2;i<=m;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()
{
    while(scanf("%d",&a)!=EOF)
    {
        if(a==0) break;
        if(a==1)
        {
            printf("0\n");
            continue;
        }
        int ans=euler_phi(a);
        printf("%d\n",ans);
    }

    return 0;
}