CodeForces - 476C-Dreamoon and Sums(数学思维)

C. Dreamoon and Sums

题解：设$$x=q\cdot b+r\text{\hspace{1em}(1)}$$则有

$$div(x,b)=q,mod(x,b)=r\in [1,b-1]\text{\hspace{1em}(2)}$$
$$\frac{(1)}{r}=>\frac{x}{r}=\frac{q\cdot b}{r}+1\text{\hspace{1em}(3)}$$
题目所求$$\frac{div(x,b)}{mod(x,b)}=>\frac{q}{r}=k\in [1,a]\text{\hspace{1em}(4)}$$
可得$$x=(3)\cdot r=(k\cdot b+1)\cdot r\text{\hspace{1em}(5)}$$
所以$$\sum x=\sum (k\cdot b+1)\cdot \sum r\text{\hspace{1em}(6)}$$
$$\sum x=\frac{b\cdot (b-1)}{2}\left[(b+1)\cdot a+\frac{a\cdot (a-1)}{2}\cdot b\right]\text{\hspace{1em}(7)}$$

代码

#include<bits/stdc++.h>
typedef long long LL;
using namespace std;
const int mod = 1e9+7;
int main()
{
#ifndef ONLINE_JUDGE
    freopen("input.in","r",stdin);
#endif
	LL a,b;
	cin>>a>>b;
	LL t = ((b + 1) * a ) % mod;
	LL tmp = (a * (a - 1) / 2) % mod;
	tmp = tmp * b % mod;
	tmp = (tmp + t) % mod;
	t = (b - 1) * b / 2 % mod;
	cout<<(t * tmp) % mod<<endl;
    return 0;
}