题意:给出n,求sigma(gcd(n,i))。
思路:对于n的一个约数g,和n的公约数为g的数的个数为phi(n/g),所以只需要求出sigma(phi(n/i)*i)即可。
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<iostream>
#include<algorithm>
#include<vector>
#include<map>
#include<queue>
#include<stack>
#include<string>
#include<map>
#include<set>
#include<ctime>
#define eps 1e-6
#define LL long long
#define pii pair<int, int>
//#pragma comment(linker, "/STACK:1024000000,1024000000")
using namespace std;
const int MAXN = 1000100;
//const int INF = 0x3f3f3f3f;
int n;
int phi(int n) {
int m = (int)sqrt(n+0.5);
int ans = n;
for(int i = 2; i <= m; 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() {
//freopen("input.txt", "r", stdin);
while(cin >> n) {
LL ans = 0;
int m = (int)sqrt(n+0.5);
for(int i = 1; i <= m; i++) if(n%i == 0){
ans += (LL)phi(n/i)*i;
if(i!=n/i) ans += (LL)phi(i)*(n/i);
}
cout << ans << endl;
}
return 0;
}