模板2:求单个数的欧拉函数( O(sqrt(n)) )

#include<bits/stdc++.h>
using namespace std;

#define ll long long

ll eular(ll n)
{
    ll ans=n;
    for(int i=2;i*i<=n;i++)
    {
        if(n%i==0)
        {
            ans-=ans/i;
            while(n%i==0)
            {
                n/=i;
            }
        }
    }
    if(n>1) ans-=ans/n;
    return ans;
}

猜你喜欢

转载自blog.csdn.net/z26y25j10/article/details/82389772