题目链接 https://nanti.jisuanke.com/t/42386
推导过程(由于Latex太麻烦就直接板书)
AC代码:
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod=998244353;
ll get_inv(ll dishu,ll zhishu)//a,p-2,,p是mod
{
ll ans=1;
while(zhishu)
{
if(zhishu&1)
{
zhishu--;
ans=ans*dishu%mod;
}
else
{
zhishu>>=1;
dishu=dishu*dishu%mod;
}
}
return ans;
}
int main()
{
ll n;
cin>>n;
ll sn =sqrt(n);
ll ans=(n+1)%mod*((n-sn)%mod)%mod*((n+sn+1)%mod)%mod*get_inv(2,mod-2)%mod;
ans=(ans%mod+mod)%mod;
ans=ans-(n%mod)*((n+1)%mod)%mod*((2*n+1)%mod)%mod*get_inv(6,mod-2)%mod;
ans=(ans%mod+mod)%mod;
ans=ans+(sn%mod)*((sn+1)%mod)%mod*((2*sn+1)%mod)%mod*get_inv(6,mod-2)%mod;
ans=(ans%mod+mod)%mod;
for(ll i=2;i<=sn;i++)
{
ll sum=0;
ll x=1;
ll begin = pow(i,x);
while(begin<=n)
{
ll end=pow(i,x+1)-1;
if(end>n)
{
sum=(sum+(n-begin+1)%mod*x%mod)%mod;
}
else
{
sum=(sum+(end-begin+1)%mod*x%mod)%mod;
}
x++;
begin = pow(i,x);
}
ans=(ans+sum*i%mod)%mod;
}
ans=(ans%mod+mod)%mod;
cout<<ans;
return 0;
}