bzoj3561: DZY Loves Math VI 莫比乌斯反演

bzoj3561: DZY Loves Math VI

Description

给定正整数n,m。求

Input

一行两个整数n,m。

Output

一个整数，为答案模1000000007后的值。

Sample Input

5 4

Sample Output

424

HINT

数据规模：
1<=n,m<=500000，共有3组数据。

分析

裸莫反
$ans=\sum_d ^n \sum_i^n \sum_j^m [gcd(i,j)==d](\frac{ij}{d})^d$
$=\sum_d^n\sum_i^{\frac{n}{d}} \sum_j^{\frac{m}{d}} [gcd(i,j)==1](\frac{idjd}{d})^d$
$=\sum_d^n d^d\sum_i^{\frac{n}{d}} \sum_j^{\frac{m}{d}} \sum_{k|i,k|j}\mu(k) (ij)^d$
$=\sum_d^n d^d\sum_k^{\frac{n}{d}}\mu(k)\sum_i^{\frac{n}{kd}} \sum_j^{\frac{m}{kd}} (ikjk)^d$
$=\sum_d^n d^d\sum_k^{\frac{n}{d}}\mu(k)k^{2d}\sum_i^{\frac{n}{kd}} i^d\sum_j^{\frac{m}{kd}} j^d$
枚举$d,k$复杂度是调和级数的$O(nlogn)$，后面那个预处理/顺便处理/等比数列求和都可以。

代码

#include<cstdio>
const int N = 5e5 + 10, P = 1e9 + 7;
int u[N], pr[N], pw[N], s[N], tp, n, m; bool v[N];
int M(int a, int b) {return 1LL * a * b % P;}
int A(int a, int b) {a += b; return a >= P ? a - P : a;}
int Pow(int x, int k) {int r = 1; for(;k; x = M(x, x), k >>= 1) if(k & 1) r = M(r, x); return r;}
void Pre(int N) {
    u[1] = 1;
    for(int i = 2;i <= N; ++i) {
        if(!v[i]) pr[++tp] = i, u[i] = P - 1;
        for(int j = 1, t; j <= tp && pr[j] * i <= N; ++j) {
            v[t = i * pr[j]] = true;
            if(i % pr[j]) u[t] = u[i] ? P - u[i] : u[i];
            else break;
        }
    }
}
int main() {
    scanf("%d%d", &n, &m);
    if(n > m) n ^= m ^= n ^= m; Pre(m);
    for(int i = 1;i <= m; ++i) pw[i] = 1; int r = 0;
    for(int i = 1;i <= n; ++i) {
        for(int j = 1;j <= m / i; ++j) pw[j] = M(pw[j], j), s[j] = A(pw[j], s[j - 1]);
        int t = 0;
        for(int j = 1;j <= n / i; ++j) if(u[j])
            t = A(t, M(M(M(pw[j], pw[j]), M(s[n / i / j], s[m / i / j])), u[j]));
        r = A(r, M(t, Pow(i, i)));
    }
    printf("%d\n", r);
    return 0;
}