\begin{gather*} &ans=\sum^{n}_{i=1}\sum^{m}_{j=1}\frac{ij}{gcd(i,j)}\\ &ans=\sum^{n}_{d=1}\sum^{m}_{i=1}\sum^{n}_{j=1}\frac{ij}{d}[gcd(i,j)==d]\\ &ans=\sum^{n}_{d=1}\frac{1}{d}\sum^{m}_{i=1}i\sum^{...
问题为:然后就可以用线性筛递推以后用整数分块计算答案。#include <bits/stdc++.h> const int MAXN = 1e7; using namespace std; int T,n,m,cnt; int p[MAXN+5],g[MAXN+5],a[MAXN+5],b[MAXN+5]; bool vis[MAXN+5]; inline void in...