Submission #1105997

#TimeUsernameProblemLanguageResultExecution timeMemory
1105997dzhoz0Savrsen (COCI17_savrsen)C++17
30 / 120
206 ms39564 KiB
#include <bits/stdc++.h> using namespace std; const int MAXN = 1e7; int sumFactor[MAXN + 5]; void init() { memset(sumFactor, 0, sizeof(sumFactor)); for (long long p = 1; p * p <= MAXN; p++) { sumFactor[p * p] += p; for (long long q = p + 1; p * q <= MAXN; q++) sumFactor[p * q] += p + q; } } int main() { init(); int l, r; cin >> l >> r; int res = 0; for(int x = l; x <= r; x++) { res += abs(2 * x - sumFactor[x]); } cout << res << '\n'; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...