BZOJ2956: 模积和(分块大法好)

推完公式分块即可。

#include<cstdio>
#include<algorithm>
#include<cmath>
#include<set>
#include<map>
#include<vector>
#define inf 1000000000
#define mod 19940417
#define ine 3323403
#define ll long long
using namespace std;
ll sum(ll a,ll b)
{
    return (a+b)*(b-a+1)/2%mod;
}
ll sum2(ll x)
{
    return x*(x+1)%mod*(2*x+1)%mod*ine%mod;
}
ll cal(ll n)
{
    int i,j;
    ll ans=0;
    for(i=1;i<=n;i=j+1)
    {
        j=n/(n/i);
        ans=(ans+n*(j-i+1)%mod-sum(i,j)*(n/i)%mod)%mod;
    }
    return (ans+mod)%mod;
}
int main()
{
    ll n,m;
    scanf("%lld%lld",&n,&m);
    if(n<m)swap(n,m);
    int i,j;
    ll ans=0;
    ans=cal(n)*cal(m)%mod;
    ll ans1,ans2,ans3;
    for(i=1;i<=m;i=j+1)
    {
        j=min(n/(n/i),m/(m/i));
        ans1=n*m%mod*(j-i+1)%mod;
        ans2=(n/i)*(m/i)%mod*(sum2(j)-sum2(i-1)+mod)%mod;
        ans3=(n*(m/i)%mod+m*(n/i)%mod)%mod*sum(i,j)%mod;
        ans=(ans-(ans1+ans2-ans3)%mod+mod)%mod;
    }
    printf("%lld\n",(ans+mod)%mod);
    return 0;
}