2705: [SDOI2012]Longge的问题

考虑把式子化成

然后就可以枚举n的因子，然后求出其欧拉函数值即可.

c++代码如下：

#include<bits/stdc++.h>
#define rep(i,x,y) for(register int i = x ; i <= y ;++ i)
#define repd(i,x,y) for(register int i = x ; i >= y ;-- i)
typedef long long ll;
using namespace std;
template<typename T>inline void read(T&x)
{
	x = 0;char c;int sign = 1;
	do { c = getchar(); if(c == '-') sign = -1; }while(!isdigit(c));
	do { x = x * 10 + c - '0'; c = getchar(); }while(isdigit(c));
	x *= sign;
}

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

int main()
{
	ll n;
	read(n);
	
	ll ans = 0;
	for(register int i = 1; i * i <= n; ++ i)
		if(n%i == 0)
		{
			ans += n/i*phi(i);
			if(n/i != i) ans += i*phi(n/i);
		}
	
	cout << ans << endl;
	
	return 0;
}