CodeForces - 616E

Calculate the value of the sum: n mod 1 + n mod 2 + n mod 3 + … + n mod m. As the result can be very large, you should print the value modulo 109 + 7 (the remainder when divided by 109 + 7).

The modulo operator a mod b stands for the remainder after dividing a by b. For example 10 mod 3 = 1.

Input
The only line contains two integers n, m (1 ≤ n, m ≤ 1013) — the parameters of the sum.

Output
Print integer s — the value of the required sum modulo 109 + 7.

Example
Input
3 4
Output
4
Input
4 4
Output
1
Input
1 1
Output
0

先把取余换成减法
然后求和

求和的过程需要优化
比如n/(n/2)到n/(n/3)值是一样的
那这些范围里只需要一个高斯求和
左边是a的话右边范围就是n/(n/a)
主要会爆long long

#include<bits/stdc++.h>
using namespace std;
#define int long long 
int mo=1e9+7;
main()
{
    int n,m;
    cin>>n>>m;
    int quanbu=(n%mo)*(m%mo)%mo;
    quanbu%=mo;
    int zanshi=0;
    for(int a=1;a<=min(n,m);a++)
    {
        int you=min(n/(n/a),m);
        int shouwei=a+you;
        int xiangshu=you-a+1;
        if(shouwei%2==0)shouwei/=2;
        else xiangshu/=2;
        shouwei%=mo,xiangshu%=mo;
        int yy=(shouwei%mo)*(xiangshu%mo);
        yy%=mo;
        yy*=(n/a)%mo;
        yy%=mo;
        zanshi+=yy%mo;
        zanshi%=mo;
        a=you;
    }
    zanshi%=mo;
    cout<<(quanbu-zanshi+mo)%mo;
}