于神之怒加强版题解

$$\begin{gathered} \sum _{i=1}^n\sum _{j=1}^m\gcd (i,j{)}^k \\ \sum _{i=1}^n\sum _{j=1}^m\sum _g{g}^k[\gcd (i,j)=g] \\ \sum _g{g}^k\sum _{i=1}^{\lfloor \frac{n}{g}\rfloor }\sum _{j=1}^{\lfloor \frac{m}{g}\rfloor }[\gcd (i,j)=1] \\ \sum _g{g}^k\sum _{i=1}^{\lfloor \frac{n}{g}\rfloor }\sum _{j=1}^{\lfloor \frac{m}{g}\rfloor }\sum _{d\mid \gcd (i,j)}\mu (d) \\ \sum _g^{\min (n,m)}{g}^k\sum _d^{\min (\lfloor \frac{n}{g}\rfloor ,\lfloor \frac{m}{g}\rfloor )}\mu (d)\lfloor \frac{n}{gd}\rfloor \lfloor \frac{m}{gd}\rfloor \\ \sum _{T=1}^{\min (n,m)}\sum _{g\mid T}{g}^k\mu (\frac{T}{g})\lfloor \frac{n}{T}\rfloor \lfloor \frac{m}{T}\rfloor \\ \sum _{T=1}^{\min (n,m)}\lfloor \frac{n}{T}\rfloor \lfloor \frac{m}{T}\rfloor \sum _{g\mid T}{g}^k\mu (\frac{T}{g}) \\ h(T)=\sum _{g\mid T}{g}^k\mu (\frac{T}{g}) \\ \sum _{T=1}^{\min (n,m)}\lfloor \frac{n}{T}\rfloor \lfloor \frac{m}{T}\rfloor h(T) \end{gathered}$$
因为 $f(n)={\sum }_{d\mid n}{d}^k,\mu (n)$ 都是积性函数，由迪利克雷卷积可知，$(f\ast \mu )(n)$ 也是积性函数，所以 $h(T)$ 是一个积性函数。

参考代码

#include <set>
#include <map>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdio>
#include <vector>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
#define fi first
#define se second
#define db double
#define LL long long
#define int long long
#define PII pair <int, int>
#define ULL unsigned long long
#define MP(x,y) make_pair (x, y)
#define rep(i,j,k) for (int i = (j); i <= (k); i++)
#define per(i,j,k) for (int i = (j); i >= (k); i--)

template <typename T>
void read (T &x) {
    x = 0; T f = 1; 
    char ch = getchar ();
    while (ch < '0' || ch > '9') {
        if (ch == '-') f = -1;
        ch = getchar ();
    }
    while (ch >= '0' && ch <= '9') {
        x = (x << 3) + (x << 1) + ch - '0';
        ch = getchar ();
    }
    x *= f;
}
template <typename T, typename... Args>
void read (T &x, Args&... Arg) {
    read (x), read (Arg...);
}
const int MaxPrint = 1000;
int Poi_For_Print, Tmp_For_Print[MaxPrint + 5];
template <typename T>
void write (T x) {
	if (x == 0) {
		putchar ('0');
		return;
	}
    bool flag = (x < 0 ? 1 : 0);
    x = (x < 0 ? -x : x);
    while (x) Tmp_For_Print[++Poi_For_Print] = x % 10, x /= 10;
    if (flag) putchar ('-');
    while (Poi_For_Print) putchar (Tmp_For_Print[Poi_For_Print--] + '0');
}
template <typename T, typename... Args>
void write (T x, Args... Arg) {
    write (x); putchar (' '); write (Arg...);
}
template <typename T, typename... Args>
void print (T x, char ch) {
    write (x); putchar (ch);
}
template <typename T> T Max (T x, T y) { return x > y ? x : y; }
template <typename T> T Min (T x, T y) { return x < y ? x : y; }
template <typename T> T Abs (T x) { return x > 0 ? x : -x; }

const int Mod = 1e9 + 7;
const int Maxn = 5 * 1e6;

int t, k, n, m;

int quick_pow (int x, int y) {
    int res = 1;
    while (y) {
        if (y & 1) res = (res * x) % Mod;
        x = (x * x) % Mod; y >>= 1;
    }
    return res;
}
int cnt, primes[Maxn + 5];
int mu[Maxn + 5], h[Maxn + 5], pre[Maxn + 5], px[Maxn + 5];
bool vis[Maxn + 5];
void Euler () {
    mu[1] = 1;
    h[1] = 1;
    rep (i, 2, Maxn) {
        if (!vis[i]) {
            primes[++cnt] = i;
            mu[i] = -1;
            h[i] = quick_pow (i, k) * mu[1] % Mod + quick_pow (1, k) * mu[i] % Mod;
            h[i] %= Mod;
            px[i] = i;
        }
        rep (j, 1, cnt) {
            if (primes[j] > Maxn / i) break;
            vis[primes[j] * i] = 1;
            if (i % primes[j] == 0) {
                mu[i * primes[j]] = 0;
                if (i == px[i]) h[i * primes[j]] = quick_pow (i * primes[j], k) + mu[primes[j]] * quick_pow (i, k) % Mod;
                else h[i * primes[j]] = h[i / px[i]] * h[primes[j] * px[i]] % Mod; // i * primes[j] = primes[j] ^ q 要特判 
                px[i * primes[j]] = px[i] * primes[j] % Mod;
                break;
            }
            mu[i * primes[j]] = (mu[i] * mu[primes[j]]) % Mod;
            h[i * primes[j]] = (h[i] * h[primes[j]]) % Mod;
            px[i * primes[j]] = primes[j];
        }
    }
    rep (i, 1, Maxn) pre[i] = (pre[i - 1] + h[i]) % Mod;
}

signed main () {
//    freopen ("C:\\Users\\Administrator\\Desktop\\lihan\\1.in", "r", stdin);
//     freopen ("C:\\Users\\Administrator\\Desktop\\lihan\\1.out", "w", stdout);

    read (t, k);
    Euler ();
    while (t--) {
        read (n, m);
        
        int l = 1, r, res = 0;
        while (l <= Min (n, m)) {
            r = Min (n / (n / l), m / (m / l));
            res += (n / l) * (m / l) % Mod * (pre[r] - pre[l - 1]) % Mod;
            res = (res % Mod + Mod) % Mod;
            l = r + 1;
        }
        print (res, '\n');
    }
    return 0;
}

---

又是推错的废式子

$$\begin{array}{r}\sum _{i=1}^n\sum _{j=1}^m\gcd (i,j{)}^k\\ \sum _{i=1}^n\sum _{j=1}^m\sum _g{g}^k[\gcd (i,j)=g]\\ \sum _g{g}^k\sum _{i=1}^{\lfloor \frac{n}{g}\rfloor }\sum _{j=1}^{\lfloor \frac{m}{g}\rfloor }[\gcd (i,j)=1]\\ \sum _g{g}^k\sum _{i=1}^{\lfloor \frac{n}{g}\rfloor }\sum _{j=1}^{\lfloor \frac{m}{g}\rfloor }\sum _{d\mid \gcd (i,j)}\mu (d)\\ \sum _g^{\min (n,m)}{g}^k\sum _d^{\min (\lfloor \frac{n}{g}\rfloor ,\lfloor \frac{m}{g}\rfloor )}\mu (d)\lfloor \frac{n}{gd}\rfloor \lfloor \frac{m}{gd}\rfloor \\ h(g)=\sum _d^{\min (\lfloor \frac{n}{g}\rfloor ,\lfloor \frac{m}{g}\rfloor )}\mu (d)\lfloor \frac{\lfloor \frac{n}{g}\rfloor }{d}\rfloor \lfloor \frac{\lfloor \frac{m}{g}\rfloor }{d}\rfloor \\ \sum _g^{\min (n,m)}{g}^{k}h(g)\end{array}$$
​