Submission #151314

#TimeUsernameProblemLanguageResultExecution timeMemory
151314Linca_RobertSavrsen (COCI17_savrsen)C++14
120 / 120
1450 ms39500 KiB
#include<bits/stdc++.h> using namespace std; const int DIM = 1e7 + 5; int A, B, f[DIM]; long long ans = 0; int main(){ cin >> A >> B; for( int i = 1; i <= B; i++ ){ f[i] -= i; for( int j = i + i; j <= B; j += i ) f[j] += i; } for( int i = A; i <= B; i++ ) ans += max( f[i], -f[i] ); cout << ans << endl; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...