（hdu1787）GCD Again（欧拉函数）

Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 3654 Accepted Submission(s): 1615

Problem Description
Do you have spent some time to think and try to solve those unsolved problem after one ACM contest?
No? Oh, you must do this when you want to become a “Big Cattle”.
Now you will find that this problem is so familiar:
The greatest common divisor GCD (a, b) of two positive integers a and b, sometimes written (a, b), is the largest divisor common to a and b. For example, (1, 2) =1, (12, 18) =6. (a, b) can be easily found by the Euclidean algorithm. Now I am considering a little more difficult problem:
Given an integer N, please count the number of the integers M (0

#include<cstdio>
#include<cmath>
using namespace std;
int phi(int n)
{
    int ans=n;
    for(int i=2; i<=sqrt(n+0.5); 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()
{
    int n,ans;
    while(~scanf("%d",&n)&&n)
    {
        ans=phi(n);
        ans=n-1-ans;///注意要减去本身这个数
        printf("%d\n",ans);
    }
    return 0;
}