zoj1906,Relatives 欧拉函数

一叶落寞，万物失色。

链接：https://vjudge.net/problem/ZOJ-1906

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

题意：求小于n的与n互素的数的个数；

思路：这不就是欧拉函数吗？？？

代码：

#include<stdio.h>
#include<algorithm>
#include<iostream>
using namespace std;
int oula(int n)
{
    int res=n;
    for(int i=2;i*i<=n;i++)
    {
        if(n%i==0)
        {
        n/=i;
        res=res-res/i;
        while(n%i==0)
        n=n/i;

        }
    }
    if(n>1)
    res=res-res/n;
    return res;
}
int main()
{
    int n,m,k,l;
    while(scanf("%d",&n)&&n!=0)
    {
    printf("%d\n",oula(n));
    }


}