在数论,对正整数n,欧拉函数是小于或等于n的正整数中与n互质的数的数目(φ(1)=1)。 例如φ(8)=4,因为1,3,5,7均和8互质。
φ(1)=1(和1互质的数(小于等于1)就是1本身)。
注意:每种质因数只一个。比如12=2*2*3那么φ(12)=12*(1-1/2)*(1-1/3)=4
若n是质数p的k次幂,因为除了p的倍数外,其他数都跟n互质。
设n为正整数,以 φ(n)表示不超过n且与n互素的正整数的个数,称为n的欧拉函数值。
摘自百度百科。
模板题:
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
code:
#include<stdio.h>
int euler(int n)
{
int ans=n;
for(int i=2;i*i<=n;i++)
{
if((n%i)==0)
{
ans=ans/i*(i-1);
while(n%i==0)
{
n/=i;
}
}
}
if(n>1) ans=ans/n*(n-1); //当n是由两个质因数组成的时候,条件成立
return ans;
}
int main()
{
int n;
while(scanf("%d",&n)&&n)
{
printf("%d\n",euler(n));
}
return 0;
}