牛客练习赛53-B(美味果冻)
传送门
题意:计算
∑
i
=
1
n
∑
j
=
1
i
i
∗
⌊
i
j
⌋
j
\sum_{i=1}^{n}\sum_{j=1}^{i}i*{\lfloor\frac{i}{j}\rfloor}^j
∑i=1n∑j=1ii∗⌊ji⌋j对
1
e
+
7
1e+7
1e+7取模
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod=1e9+7;
const int N=3e6+10;
ll inv[N];
ll ksm(ll a,ll b)
{
ll res=1;
while(b){
if(b&1)res=res*a%mod;
a=a*a%mod;
b>>=1;
}return res;
}
int main()
{
ios::sync_with_stdio(false);
ll n;cin>>n;
ll inv2=ksm(2,mod-2),ans=0;
for(int i=1;i<=n;i++)inv[i]=1ll;
for(int j=1;j<=n;j++){
for(int i=j;i<=n;i+=j){
int r=min(1ll*(i+j-1),n);
int k=i/j;
inv[k]=inv[k]*k%mod;
ans=(ans+1ll*(i+r)*(r-i+1)%mod*inv2%mod*inv[k]%mod)%mod;
}
}
cout<<ans<<endl;
return 0;
}