思路:将式子分母移过去其实就是x = m(kb+1),m是x%b的值,显然m的取值范围是1到b-1,然后先求出m,然后枚举k即可
#include<bits/stdc++.h>
using namespace std;
#define LL long long
LL ans = 0;
const LL mod = 1e9+7;
int main()
{
LL a,b;
scanf("%lld%lld",&a,&b);
LL m = (b-1)*b/2;
m%=mod;
for(int i = 1;i<=a;i++)
{
LL tmp = (i*b+1)%mod;
ans = (ans + m*tmp%mod)%mod;
}
printf("%lld\n",ans);
}
Dreamoon loves summing up something for no reason. One day he obtains two integers a and b occasionally. He wants to calculate the sum of all nice integers. Positive integer x is called nice if and , where k is some integer number in range[1, a].
By we denote the quotient of integer division of x and y. By we denote the remainder of integer division of x and y. You can read more about these operations here: http://goo.gl/AcsXhT.
The answer may be large, so please print its remainder modulo 1 000 000 007 (109 + 7). Can you compute it faster than Dreamoon?
The single line of the input contains two integers a, b (1 ≤ a, b ≤ 107).
Print a single integer representing the answer modulo 1 000 000 007 (109 + 7).
1 1
0
2 2
8
For the first sample, there are no nice integers because is always zero.
For the second sample, the set of nice integers is {3, 5}.