题目
思路
大概就是枚举 1 1 1~ n n n的因子。因子为 i i i时,有 ⌊ n / i ⌋ \lfloor n/i \rfloor ⌊n/i⌋个数会用它做因子。
代码
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<cctype>
#include<ctime>
#include<iostream>
#include<string>
#include<map>
#include<queue>
#include<stack>
#include<set>
#include<vector>
#include<iomanip>
#include<list>
#include<bitset>
#include<sstream>
#include<fstream>
#include<complex>
#include<algorithm>
#if __cplusplus >= 201103L
#include <unordered_map>
#include <unordered_set>
#endif
#define int long long
using namespace std;
const int INF = 0x3f3f3f3f;
const int mod=998244353;
const int inv6=166374059;
const int inv2=499122177;
int cal(int x){
return (x*(x+1)%mod*(2*x+1)%mod)*inv6%mod;
}
signed main(){
ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
int n;
cin>>n;
int s1=0,s2=0,s3=0;
int j=0;
for(int i=1;i<=n;i=j+1){
j=n/(n/i);
s1=(s1+(cal(j)-cal(i-1)+mod)%mod*(n/i)%mod)%mod;
s2=(s2+(j*(j+1)%mod*inv2%mod-i*(i-1)%mod*inv2%mod+mod)%mod*(n/i)%mod)%mod;
s3=(s3+(j-i+1)*(n/i)%mod)%mod;
}
cout<<((2*s1+3*s2)%mod+5*s3)%mod<<endl;
return 0;
}
这里插入代码片