给出n,问1~n中所有数gcd(i,n)之和.n为1e9
想要枚举gcd,但是找不到规律..
看了题解,这样用欧拉函数是第一次见
假设gcd(i,n) = x
那么 gcd(i/x,n/x) = 1
那么,这样的i数量就为 phi(n/x)
#include <iostream>
#include <set>
#include <vector>
#include <map>
#include <algorithm>
#include <cstring>
#define debug(x) //std::cerr << #x << " = " << (x) << std::endl
using namespace std;
typedef long long LL;
const int MAXN = 1e5+17;
const int MOD = 1e9+7;
int prime[1100000],primesize=0;
bool isprime[1100000];
void sieve(int listsize){
memset(isprime, 1, sizeof(isprime));
isprime[1] = false;
for(int i=2;i<=listsize;i++){
if(isprime[i]) prime[++primesize]=i;
for(int j = 1; j <= primesize && i*prime[j] <= listsize;j++){
isprime[i*prime[j]] = false;
if(i%prime[j] == 0) break;
}
}
}
LL qm(LL a,LL b)
{
LL ret = 1;
while(b)
{
if(b&1) ret = a*ret%MOD;
b>>=1;
a=a*a%MOD;
}
return ret;
}
LL cphi(LL n)
{
LL ret = n,on = n;
for(int i=1;i<=primesize;++i)
{
int p = prime[i];
if(p>n||p*p>on) break;
if(n%p==0)
{
ret/=p;
ret*=(p-1);
while(n%p==0) n/=p;
}
}
if(n!=1) ret/=n,ret*=(n-1);
return ret;
}
int main()
{
#ifdef noob
freopen("Input.txt", "r", stdin);
freopen("Output.txt", "w", stdout);
#endif
sieve(100000);
int n;
cin>>n;
LL ans = 0;
for (LL i = 1; i*i <= n; ++i)
{
if(n%i==0)
{
debug(i);
debug(cphi(n/i));
ans += cphi(n/i)*i;
LL v = n/i;
if(i!=v)ans += cphi(n/v)*v;
}
}
cout<<ans<<endl;
return 0;
}