题意:
解法:
欧拉筛O(n*log)计算出每个数的因子数,
然后O(n)计算答案即可.
code:
#include<bits/stdc++.h>
#define int long long
using namespace std;
const int maxm=1e7+5;
int cnt[maxm];
int n;
void solve(){
cin>>n;
for(int i=1;i<=n;i++){
for(int j=i;j<=n;j+=i){
cnt[j]++;
}
}
int ans=0;
for(int i=1;i<=n;i++){
ans+=i*cnt[i];
}
cout<<ans<<endl;
}
signed main(){
ios::sync_with_stdio(0);
solve();
return 0;
}