oj.uz

Submission #1110428

# Submission time Handle Problem Language Result Execution time Memory
1110428 2024-11-09T12:17:07 Z LucasLe Savrsen (COCI17_savrsen) C++17
120 / 120
 214 ms 39672 KB 
#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;
    }
}
signed main() {
    init();
    int l, r; cin >> l >> r;
    long long res = 0;
    for(int x = l; x <= r; x++) {
        res += abs(2 * x - sumFactor[x]);
    }
    cout << res << '\n';
    return 0;
}

Subtask #1
120.0 / 120.0

# Verdict Execution time Memory Grader output
1 Correct 185 ms 39504 KB Output is correct
2 Correct 182 ms 39560 KB Output is correct
3 Correct 192 ms 39504 KB Output is correct
4 Correct 180 ms 39504 KB Output is correct
5 Correct 192 ms 39504 KB Output is correct
6 Correct 214 ms 39560 KB Output is correct
7 Correct 206 ms 39572 KB Output is correct
8 Correct 186 ms 39672 KB Output is correct