luogu P2260 [清华集训2012]模积和 & P2834 能力测验

背景：

又来刷水题了。

题目传送门：

https://www.luogu.org/problem/P2260
https://www.luogu.org/problem/P2834

题意：

求${\sum }_{i=1}^n{\sum }_{j=1,j̸=i}^m(n\mathrm{m}\mathrm{o}\mathrm{d}i)(m\mathrm{m}\mathrm{o}\mathrm{d}j)$

思路：

$$\sum _{i=1}^n\sum _{j=1,j̸=i}^m(n\mathrm{m}\mathrm{o}\mathrm{d}i)(\mathrm{m}\mathrm{o}\mathrm{d}j)$$

$$=\sum _{i=1}^n\sum _{j=1}^m(n\mathrm{m}\mathrm{o}\mathrm{d}i)(m\mathrm{m}\mathrm{o}\mathrm{d}j)-\sum _{i=1}^{\min (n,m)}(n\mathrm{m}\mathrm{o}\mathrm{d}i)(m\mathrm{m}\mathrm{o}\mathrm{d}i)$$

$$=\sum _{i=1}^n(n\mathrm{m}\mathrm{o}\mathrm{d}i)\sum _{j=1}^m(m\mathrm{m}\mathrm{o}\mathrm{d}j)-\sum _{i=1}^{\min (n,m)}(n\mathrm{m}\mathrm{o}\mathrm{d}i)(m\mathrm{m}\mathrm{o}\mathrm{d}i)$$

我们定义：
$f_n={\sum }_{i=1}^n(n\mathrm{m}\mathrm{o}\mathrm{d}i)$
$f_m={\sum }_{i=1}^m(m\mathrm{m}\mathrm{o}\mathrm{d}i)$
$F_{\min (n,m)}={\sum }_{i=1}^{\min (n,m)}(n\mathrm{m}\mathrm{o}\mathrm{d}i)(m\mathrm{m}\mathrm{o}\mathrm{d}i)$，则：
$$ans=f_n{f}_m-F_{\min (n,m)}$$
考虑：
$$\begin{array}{rl}{f}_n& =\sum _{i=1}^n(n\mathrm{m}\mathrm{o}\mathrm{d}i)\\ & =\sum _{i=1}^{n}n-\lfloor \frac{n}{i}\rfloor i\\ & =n^2-\sum _{i=1}^n\lfloor \frac{n}{i}\rfloor i\end{array}$$

就可以整除分块。

考虑：
$$\begin{array}{rl}{F}_{\min (n,m)}& =\sum _{i=1}^{\min (n,m)}(n\mathrm{m}\mathrm{o}\mathrm{d}i)(m\mathrm{m}\mathrm{o}\mathrm{d}i)\\ & =\sum _{i=1}^{\min (n,m)}(n-\lfloor \frac{n}{i}\rfloor i)(m-\lfloor \frac{m}{i}\rfloor i)\\ & =\sum _{i=1}^{\min (n,m)}nm-i(m\lfloor \frac{n}{i}\rfloor +n\lfloor \frac{m}{i}\rfloor )+i^2\lfloor \frac{n}{i}\rfloor \lfloor \frac{m}{i}\rfloor \\ & =nm\cdot \min (n,m)\cdot \sum _{i=1}^{\min (n,m)}-i(m\lfloor \frac{n}{i}\rfloor +n\lfloor \frac{m}{i}\rfloor )+i^2\lfloor \frac{n}{i}\rfloor \lfloor \frac{m}{i}\rfloor \end{array}$$

就可以整除分块了。
${\sum }_{i=1}^n{i}^2=\frac{(n)(n+1)(2n+1)}{6}$，而$\mathrm{m}\mathrm{o}\mathrm{d}\notin prime$，因此不能费马小定理求逆元，我就离线暴力求了，你可以扩欧。

$\text{P2260}$代码：

#include<cstdio>
#include<cstring>
#include<algorithm>
#define LL long long
#define mod 19940417
#define inv6 3323403
using namespace std;
	LL n,m;
LL work1(LL x,LL y)
{
	return ((x+y)*(y-x+1)/2)%mod;
}
LL work_pow(LL x)
{
	return x*(x+1)%mod*((2ll*x+1)%mod)%mod*inv6%mod;
}
LL work2(LL x,LL y)
{
	return (work_pow(y)-work_pow(x-1)+mod)%mod;
}
LL calc(LL n)
{
	LL sum=0;
	for(LL l=1,r;l<=n;l=r+1)
	{
		r=n/(n/l);
		sum=(sum+(n/l)*work1(l,r)%mod)%mod;
	}
	return (n*n%mod-sum+mod)%mod;
}
LL Calc(LL n,LL m)
{
	LL sum=0;
	for(int l=1,r;l<=min(n,m);l=r+1)
	{
		r=min(n/(n/l),m/(m/l));
		sum=(sum-work1(l,r)*((m*(n/l)+n*(m/l))%mod)%mod+work2(l,r)*(n/l)%mod*(m/l)%mod+mod)%mod;
	}
	return (n*m%mod*min(n,m)%mod+sum)%mod;
}
int main()
{
	scanf("%lld %lld",&n,&m);
	printf("%lld",(calc(n)*calc(m)%mod-Calc(n,m)+mod)%mod);
}

$\text{P2834}$代码：

#include<cstdio>
#include<cstring>
#include<algorithm>
#define LL long long
#define mod 1000000007
#define inv6 166666668
using namespace std;
	LL n,m;
LL work1(LL x,LL y)
{
	return ((x+y)*(y-x+1)/2)%mod;
}
LL work_pow(LL x)
{
	return x*(x+1)%mod*((2ll*x+1)%mod)%mod*inv6%mod;
}
LL work2(LL x,LL y)
{
	return (work_pow(y)-work_pow(x-1)+mod)%mod;
}
LL calc(LL n)
{
	LL sum=0;
	for(LL l=1,r;l<=n;l=r+1)
	{
		r=n/(n/l);
		sum=(sum+(n/l)*work1(l,r)%mod)%mod;
	}
	return (n*n%mod-sum+mod)%mod;
}
LL Calc(LL n,LL m)
{
	LL sum=0;
	for(int l=1,r;l<=min(n,m);l=r+1)
	{
		r=min(n/(n/l),m/(m/l));
		sum=(sum-work1(l,r)*((m*(n/l)+n*(m/l))%mod)%mod+work2(l,r)*(n/l)%mod*(m/l)%mod+mod)%mod;
	}
	return (n*m%mod*min(n,m)%mod+sum)%mod;
}
int main()
{
	scanf("%lld %lld",&n,&m);
	printf("%lld",(calc(n)*calc(m)%mod-Calc(n,m)+mod)%mod);
}