oj.uz

Submission #1105997

# Submission time Handle Problem Language Result Execution time Memory
1105997 2024-10-28T16:36:24 Z dzhoz0 Savrsen (COCI17_savrsen) C++17
30 / 120
 206 ms 39564 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;
    }
}
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;
}

Subtask #1
30.0 / 120.0

# Verdict Execution time Memory Grader output
1 Correct 180 ms 39504 KB Output is correct
2 Correct 184 ms 39560 KB Output is correct
3 Incorrect 194 ms 39556 KB Output isn't correct
4 Incorrect 175 ms 39552 KB Output isn't correct
5 Incorrect 200 ms 39564 KB Output isn't correct
6 Incorrect 206 ms 39504 KB Output isn't correct
7 Incorrect 203 ms 39504 KB Output isn't correct
8 Incorrect 191 ms 39504 KB Output isn't correct