# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
1091891 |
2024-09-22T13:22:51 Z |
plagia |
Savrsen (COCI17_savrsen) |
C++14 |
|
449 ms |
39768 KB |
#include <cstdlib>
#include <iostream>
const int MM = 1e7 + 10;
int tab[MM]{};
void fill_tab() {
for (int i = 1; i < MM; i++) {
for (int j = i * 2; j < MM; j += i) {
tab[j] += i;
}
}
}
int calculate_imperfection(const int &n) {
return std::abs(n - tab[n]);
}
int main() {
std::ios_base::sync_with_stdio(0);
fill_tab();
int a, b;
std::cin >> a >> b;
unsigned long long sum = 0;
for (int i = a; i <= b; i++) {
sum += calculate_imperfection(i);
}
std::cout << sum << std::endl;
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
427 ms |
39512 KB |
Output is correct |
2 |
Correct |
435 ms |
39512 KB |
Output is correct |
3 |
Correct |
420 ms |
39572 KB |
Output is correct |
4 |
Correct |
435 ms |
39516 KB |
Output is correct |
5 |
Correct |
440 ms |
39768 KB |
Output is correct |
6 |
Correct |
429 ms |
39768 KB |
Output is correct |
7 |
Correct |
449 ms |
39516 KB |
Output is correct |
8 |
Correct |
440 ms |
39568 KB |
Output is correct |