51nod1040（欧拉函数）

传送门：http://www.51nod.com/Challenge/Problem.html#!#problemId=1040
题意：给定$n$
求${\sum }_{i=1}^{n}gcd(i,n)$
$n<=10^9$

---

$solution$：
$\ast \ast \ast$题，枚举$gcd$直接求解即可。

#include<bits/stdc++.h>
using namespace std;
#define rep(i,j,k) for(int i = j;i <= k;++i)
#define repp(i,j,k) for(int i = j;i >= k;--i)
#define rept(i,x) for(int i = linkk[x];i;i = e[i].n)
#define P pair<int,int>
#define Pil pair<int,ll>
#define Pli pair<ll,int>
#define Pll pair<ll,ll>
#define pb push_back 
#define pc putchar
#define mp make_pair 
#define file(k) memset(k,0,sizeof(k))
#define ll long long
int rd()
{
	int num = 0;char c = getchar();bool flag = true;
	while(c < '0'||c > '9') {if(c == '-') flag = false;c = getchar();}
	while(c >= '0' && c <= '9') num = num*10+c-48,c = getchar();
	if(flag) return num;else return -num;
}
int n;
ll ans;
int main()
{
	n = rd();
	int M = sqrt(n);
	rep(i,1,M) if(n%i == 0)
		rep(kk,0,1)
		{
			int t = kk?n/i:i,mx = sqrt(t),phi = t;
			if(i*i==n&&kk==1) break;
			rep(j,2,mx)
			    if(t%j == 0)
		    	{
			    	phi = phi/j*(j-1);
			    	while(t%j == 0) t /= j;
			    }
			if(t != 1) phi = phi/t*(t-1);
			ans = ans + 1ll*(kk?i:(n/i)) * phi;
		}
	printf("%lld\n",ans);
	return 0;
}