-
Bio
#include<bits/stdc++.h> using namespace std; bool isprime[10000001]; long long ans=0; int main(){ int n; cin>>n; for(long long i=2;i<=n;i++){ if(isprime[i]==0){ for(long long j=i*i;j<=n;j+=i){ if(isprime[j]==0){ isprime[j]=1; ans+=i; } } ans+=i; } } cout<<ans; return 0; }
-
Accepted Problems
-
Recent Activities
Problem Tags
- GESPC++ 二级
- 1