oj.uz

Submission #1105990

# Submission time Handle Problem Language Result Execution time Memory
1105990 2024-10-28T16:11:09 Z dzhoz0 Savrsen (COCI17_savrsen) C++17
120 / 120
 420 ms 39564 KB 
#include <bits/stdc++.h>
using namespace std;
 
const int MAXN = 1e7;
int sieve[MAXN + 5];
 
void init() 
{
    for(int i = 1; i <= MAXN; i++) sieve[i] = i;
 
    for(int i = 2; i*i <= MAXN; i++) 
    {
        if(sieve[i] == i)
        {
            for(int j = i * i; j <= MAXN; j += i) 
            {
                if(sieve[j] == j) sieve[j] = i;
            }
        }
    }
}
long long f(int n) {
    long long res = 1;
    
    while(n > 1) {
        int d = sieve[n];
        int e = 1;
        while(n % d == 0) e++, n /= d;
        long long sum = 0, pw = 1;
        while(e--) {
            sum += pw;
            pw *= d;
        }
        res *= sum;
    }
    return res;
}
 
int main()
{
    init();
    int l, r; cin >> l >> r;
    long long res = 0;
    for(int x = l; x <= r; x++)
        res += abs(x - (f(x) - x));
    cout << res << '\n';
    return 0;
}

Subtask #1
120.0 / 120.0

# Verdict Execution time Memory Grader output
1 Correct 71 ms 39564 KB Output is correct
2 Correct 65 ms 39504 KB Output is correct
3 Correct 63 ms 39560 KB Output is correct
4 Correct 60 ms 39504 KB Output is correct
5 Correct 389 ms 39564 KB Output is correct
6 Correct 420 ms 39504 KB Output is correct
7 Correct 387 ms 39504 KB Output is correct
8 Correct 147 ms 39564 KB Output is correct