CF616E Sum of Remainders（分块计算）

$$ANS=\sum\limits_{i=1}^mn\%i$$
$$ANS=\sum\limits_{i=1}^mn-\lfloor n/i\rfloor*i$$
$$ANS=nm-\sum\limits_{i=1}^m\lfloor n/i\rfloor*i$$
后面这个东西我们像计算mobius时常用的分块技巧那样来算即可。复杂度 $O(\sqrt n)$

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
#define mod 1000000007
inline char gc(){
    static char buf[1<<16],*S,*T;
    if(S==T){T=(S=buf)+fread(buf,1,1<<16,stdin);if(T==S) return EOF;}
    return *S++;
}
inline ll read(){
    ll x=0,f=1;char ch=gc();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=gc();}
    while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=gc();
    return x*f;
}
ll n,m,ans=0,inv2;
int main(){
//  freopen("a.in","r",stdin);
    n=read();m=read();if(m>n) ans+=n%mod*((m-n)%mod)%mod,m=n;ans%=mod;
    ll last;inv2=(mod-mod/2*1)%mod;
    for(ll i=2;i<=m;i=last+1){
        last=min(m,n/(n/i));ans+=(n%i+n%last)%mod*((last-i+1)%mod)%mod*inv2%mod;ans%=mod;
    }printf("%I64d\n",ans);
    return 0;
}