牛客多校第九场 KM and M(类欧几里得)
题目大意
给出n和M,求
∑
k
=
1
n
(
k
M
)
&
M
(
m
o
d
1
0
9
+
7
)
\sum_{k=1}^n(kM)\&M(mod\ 10^9+7)
k=1∑n(kM)&M(mod 109+7)
解题思路
对于kM&M对于M的每个二进制位考虑就是 ⌊ k M 2 i ⌋ − 2 ⌊ k M 2 i + 1 ⌋ \left\lfloor\frac{kM}{2^i}\right\rfloor-2\left\lfloor\frac{kM}{2^{i+1}}\right\rfloor ⌊2ikM⌋−2⌊2i+1kM⌋
由此问题就只需要计算 ⌊ k M 2 i ⌋ \left\lfloor\frac{kM}{2^i}\right\rfloor ⌊2ikM⌋的前缀和,通过类欧几里得即可算出
AC代码
#include<bits/stdc++.h>
using namespace std;
const int mod=1e9+7;
const long long inv2=(mod+1)/2;
typedef long long ll;
ll Sum(ll a,ll b,ll c,ll n){
if (!a) return 0;
ll x,y;
if(a>=c||b>=c){
x=Sum(a%c,b%c,c,n);
y=((a/c)%mod*(n%mod)%mod*((n+1)%mod)%mod*inv2+b/c%mod*((n+1)%mod)+x)%mod;
y=(y+mod)%mod;
return y;
}
ll m=((__int128)a*n+b)/c;
x=Sum(c,c-b-1,a,m-1);
y=((__int128)n*m-x)%mod;
y=(y+mod)%mod;
return y;
}
int main()
{
ll n,m;
scanf("%lld%lld",&n,&m);
ll ans=0;
for(ll p=1,loc=0;p<=m;p*=2,loc++)
{
if(m&(1LL<<loc))
ans=(ans+p%mod*((Sum(m,0,p,n)-2*Sum(m,0,2*p,n))%mod+mod))%mod;
}
printf("%lld\n",ans);
}