BZOJ 2956 模积和

最新推荐文章于 2018-09-21 10:45:00 发布

Rayment_cc

最新推荐文章于 2018-09-21 10:45:00 发布

阅读量278

点赞数

分类专栏： =====数学===== BZOJ

本文链接：https://blog.csdn.net/As_A_Kid/article/details/79565487

版权

BZOJ 同时被 2 个专栏收录

89 篇文章 0 订阅

订阅专栏

=====数学=====

32 篇文章 0 订阅

订阅专栏

Problem

BZOJ请戳我

Solution

\sum i = 1 n \sum j = 1, i \neq j m (n mod i) (m mod j) = \sum i = 1 n (n mod i) * \sum j = 1 m (m mod j) - \sum i = 1 m i n (n, m) (n mod i) (m mod i) = \sum i = 1 n (n mod i) * \sum j = 1 m (m mod j) - \sum I = 1 m i n (n, m) (n - ⌊ n i ⌋ i) (m - ⌊ m i ⌋ i) = \sum i = 1 n (n mod i) * \sum j = 1 m (m mod j) - \sum I = 1 m i n (n, m) (n m + ⌊ n i ⌋ ⌊ m i ⌋ i 2 - (m ⌊ n i ⌋ + n ⌊ m i ⌋) i)

$\sum_{i=1}^n\sum_{j=1,i\not=j}^m(n\bmod i)(m\bmod j)\\ =\sum_{i=1}^n(n\bmod i)*\sum_{j=1}^m(m\bmod j)-\sum_{i=1}^{min(n,m)}(n\bmod i)(m\bmod i)\\ =\sum_{i=1}^n(n\bmod i)*\sum_{j=1}^m(m\bmod j)-\sum_{I=1}^{min(n,m)}(n-\biggl\lfloor\frac n i\biggr\rfloor i)(m-\biggl\lfloor\frac m i\biggr\rfloor i)\\ =\sum_{i=1}^n(n\bmod i)*\sum_{j=1}^m(m\bmod j)-\sum_{I=1}^{min(n,m)}(nm+\biggl\lfloor\frac n i\biggr\rfloor \biggl\lfloor\frac m i\biggr\rfloor i^2-(m\biggl\lfloor\frac n i\biggr\rfloor +n \biggl\lfloor\frac m i\biggr\rfloor)i)$
前半部分同CQOI2007余数求和分块做一下，后半部分同样也是分块。然后

∑ni=1i2=n∗(n+1)∗(2∗n+1)6 ∑ i = 1 n i 2 = n ∗ ( n + 1 ) ∗ ( 2 ∗ n + 1 ) 6 $\sum_{i=1}^n i^2=\frac {n*(n+1)*(2*n+1)} 6$ ，6在模19940417意义下的逆元是3323403。

Code

#include <algorithm>
#include <cstdio>
using namespace std;
typedef long long ll;
const ll mod=19940417;
ll n,m,ans,a,b,c;
inline ll min(ll x,ll y){return x<y?x:y;}
inline ll sum(ll l,ll r){return ((l+r)*(r-l+1)/2)%mod;}
inline ll sqr(ll x){return x*(x+1)%mod*(x<<1|1)%mod*3323403%mod;}
ll check(ll n)
{
    ll res=n*n%mod;
    for(int i=1,j;i<=n;i=j+1)
    {
        j=n/(n/i);
        res=(res-(sum(i,j)*(n/i))+mod)%mod;
    }
    return res;
}
int main()
{
    #ifndef ONLINE_JUDGE
    freopen("in.txt","r",stdin);
    #endif
    scanf("%lld%lld",&n,&m);
    ans=(check(n)*check(m))%mod;
    if(n>m) swap(n,m);
    for(int i=1,j;i<=n;i=j+1)
    {
        j=min(n/(n/i),m/(m/i));
        a=n*m%mod*(j-i+1)%mod;
        b=(m*(n/i)%mod+n*(m/i)%mod)%mod*sum(i,j)%mod;
        c=(n/i)*(m/i)%mod*((sqr(j)-sqr(i-1)+mod)%mod)%mod;
        ans=(ans-a+b-c+mod+mod)%mod;
    }
    printf("%lld\n",ans);
    return 0;
}