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.
【题目分析】
没什么技术含量。就是简单的求欧拉函数。
【代码】
#include <cstdio>
#include <cmath>
using namespace std;
long long t,n,ans;
long long phi(long long x)
{
t=x;
for (long long i=2;i<=floor(sqrt(x));++i)
if (x%i==0){t=t/i*(i-1);while (x%i==0) x/=i;}
if (x>1) t=t/x*(x-1);
return t;
}
int main()
{while (scanf("%lld",&n)&&n) printf("%lld\n",phi(n));}