数论--P2260 [清华集训] 模积和

题目链接

喜闻乐见推柿子时间：
$$\begin{gathered} \sum _{i=1}^n\sum _{j=1}^m(n\%i)(m\%j),i\ne j \\ =\sum _{i=1}^n\sum _{j=1}^m(n-\lfloor \frac{n}{i}\rfloor i)(m-\lfloor \frac{m}{j}\rfloor j)-\sum _{i=1}^{min(n,m)}(n-\lfloor \frac{n}{i}\rfloor i)(m-\lfloor \frac{m}{i}\rfloor i) \\ =\sum _{i=1}^n(n-\lfloor \frac{n}{i}\rfloor i)\sum _{j=1}^m(m-\lfloor \frac{m}{j}\rfloor j)-\sum _{i=1}^{min(n,m)}(nm-n\lfloor \frac{m}{i}\rfloor i-m\lfloor \frac{n}{i}\rfloor i+\lfloor \frac{n}{i}\rfloor \lfloor \frac{m}{i}\rfloor i^2) \end{gathered}$$

注意平方和公式：
$$\sum _{i=1}^n{i}^2=\frac{n\ast (n+1)\ast (2n+1)}{6}$$

后面是整数分块能解决的啦
PS:在模的时候每一步都谨防出现负数（之前BD之星被坑了 ）
ACcode：

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<set>
#include<map>
#include<vector>
#define MOD 19940417
#define inv_6 3323403//6在模意义下的逆元
#define LL long long

using namespace std;

LL getsum(LL l,LL r)
{
	return ( l+r )*( r-l+1 )/2 % MOD;
}

LL getsum2(LL x)
{
	return (x) * (x+1) % MOD * (2*x+1) % MOD * inv_6 % MOD;
}

LL cal(LL n)
{
	LL l,r,sum = 0;
	for(l=1;l<=n;l=r+1)
	{
		r = n/(n/l);
		sum = ( sum + n*(r-l+1) - getsum(l,r)*(n/l)  ) % MOD;
	}
	return ( sum + MOD ) % MOD;
}

LL n,m,ans,h1,h2,h3;
void solve()
{
	LL l,r;
	cin>>n>>m;
	if( n>m ) swap(n,m);
	ans = cal(n) * cal(m) % MOD;
	for(l =1;l<=n;l=r+1)
	{
		r = min( n/(n/l) , m/(m/l) );
		h1 = n*m % MOD * (r-l+1) % MOD;
		h2 = (n/l) * (m/l) % MOD * (getsum2(r) - getsum2(l-1)+MOD) % MOD;
		h3 = (n/l*m +m/l*n) % MOD * getsum(l,r) % MOD;
		ans = ( ans - h1 - h2 + h3  )%MOD;
		ans = (ans+MOD)%MOD; 
	}
	cout<<ans;
}

int main()
{
	solve();
	return 0;
}