题目传送
求单个数的欧拉值,板子
AC代码
#include<bits/stdc++.h>
#include<iostream>
#include<stack>
#include<algorithm>
#include<queue>
#include<deque>
#include<vector>
#include<map>
#include<set>
#include<cmath>
#include<cstdio>
#include<string>
#include<cstring>
inline long long read(){char c = getchar();long long x = 0,s = 1;
while(c < '0' || c > '9') {if(c == '-') s = -1;c = getchar();}
while(c >= '0' && c <= '9') {x = x*10 + c -'0';c = getchar();}
return x*s;}
using namespace std;
#define NewNode (TreeNode *)malloc(sizeof(TreeNode))
#define Mem(a,b) memset(a,b,sizeof(a))
#define lowbit(x) (x)&(-x)
#define int long long
const int N = 2e5 + 10;
const long long INFINF = 0x7f7f7f7f7f7f7f;
const int INF = 0x3f3f3f3f;
const double EPS = 1e-5;
const int mod = 1e9+7;
const double II = acos(-1);
const double PP = (II*1.0)/(180.00);
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> piil;
signed main()
{
std::ios::sync_with_stdio(false);
cin.tie(0),cout.tie(0);
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
ll n;
while(1)
{
cin >> n;
if(n == 0) break;
ll num = n;
for(int i = 2;i * i <= n;i++)
{
if(n % i == 0)
{
num = num/i*(i-1);//先除再乘保证不会溢出
while(n%i == 0)
n /= i;
}
}
if(n > 1) num = num/n*(n-1);
cout << num << endl;
}
return 0;
}