제출 #1047538

#제출 시각아이디문제언어결과실행 시간메모리
104753812345678Savrsen (COCI17_savrsen)C++17
120 / 120
229 ms79932 KiB
#include <bits/stdc++.h> using namespace std; #define ll long long const int nx=1e7+5; ll a, b, res, dp[nx]; bitset<nx> p; int main() { cin.tie(NULL)->sync_with_stdio(false); cin>>a>>b; for (int i=1; i<=b; i++) dp[i]=1; for (ll i=2; i<=b; i++) { if (p[i]) continue; for (ll j=i; j<=b; j+=i) { p[j]=1; ll tmp=1, mul=i; while ((j%mul)==0) tmp+=mul, mul*=i; dp[j]*=tmp; } } //for (int i=1; i<=b; i++) cout<<"debug "<<dp[i]<<'\n'; for (int i=a; i<=b; i++) res+=abs(dp[i]-2*i); cout<<res; }
#Verdict Execution timeMemoryGrader output
Fetching results...