bzoj 2705: [SDOI2012]Longge的问题 【欧拉函数求GCD】

题目链接：bzoj 2705: [SDOI2012]Longge的问题

题意：求解$\sum_{i=1}^ngcd(i, n)$。

思路：用$d = gcd(i, n)$，这样$1 = gcd(i / d, n / d)$。求解$n/d$的欧拉函数。

$AC$代码：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include <stack>
#define PI acos(-1.0)
#define CLR(a, b) memset(a, (b), sizeof(a))
#define fi first
#define se second
#define ll o<<1
#define rr o<<1|1
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
const int MAXN = 5*1e5+1;
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
void getmax(int &a, int b) {a = max(a, b); }
void getmin(int &a, int b) {a = min(a, b); }
void add(LL &x, LL y) { x += y; x %= MOD; }
LL euler(LL n) {
    LL ans = n;
    for(LL i = 2; i * i <= n; i++) {
        if(n % i == 0) {
            ans = ans * (i-1) / i;
            while(n % i == 0) n /= i;
        }
    }
    if(n > 1) ans = ans * (n-1) / n;
    return ans;
}
int main()
{
    LL N; scanf("%lld", &N);
    if(N == 1) {
        printf("1\n");
        return 0;
    }
    LL ans = 0;
    for(LL i = 2; i * i <= N; i++) {
        if(N % i == 0) {
            ans += euler(i) * (N / i);
            if(i * i != N) {
                LL M = N / i;
                LL ans1 = euler(M);
                ans += ans1 * i;
            }
        }
    }
    printf("%lld\n", ans + euler(N) + N);
    return 0;
}