poj 2407 Relatives

Relatives

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 12878		Accepted: 6359

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

Waterloo local 2002.07.01

——————————————————————————

欧拉函数：

#include <stdio.h>
#include<iostream>
using namespace std;
#include <string.h>
int main()
{
    int n,m,k,i,j;
    int ans;
    while(cin>>n&&n)
    {
        m = n;
        for(i = 2,ans = n ; i*i<=n; i++)
        {
            if(n%i==0)
            {
                ans=ans *1-ans/i;
                do
                {
                    n/=i;
                }
                while(n%i==0);
            }
        }
        if(n!=1)
            ans=ans-ans/n;
        if(m==1)
            printf("0\n");
        else
            printf("%d\n",ans);
    }
    return 0;
}