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 Output6
4
#include<cstdio>
int phi(int v){
int i,s=v;
for(i=2;i*i<=v;i++){
if(v%i==0){
s-=s/i;
}
while(v%i==0) v/=i;
}
if(v>1)
s-=s/v;
return s;
}
int main(){
int n;
while(scanf("%d",&n),n)
printf("%d\n",phi(n));
return 0;
}