oj.uz

답안 #969638

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
969638 2024-04-25T11:49:35 Z RandomUser Savrsen (COCI17_savrsen) C++17
120 / 120
 1250 ms 49484 KB 
#include <bits/stdc++.h>

#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
//#define int long long

using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

const int mod = 1e9 + 7;
const int LOG = 20;
const int maxn = 1e7 + 5;
const double eps = 1e-9;

bool sieve[maxn+1];
int mpf[maxn+1];

ll exp(ll a, ll b) {
    ll ans = 1;
    while(b) {
        if(b & 1) ans = ans * a;
        a = a * a;
        b /= 2;
    }
    return ans;
}

int32_t main() {
    sieve[1] = 1;
    for(int i=2; i<=maxn; i++) {
        if(sieve[i]) continue;
        mpf[i] = i;
        for(int j=2*i; j<=maxn; j+=i) {
            sieve[j] = i;
            mpf[j] = i;
        }
    }

    int l, r;
    ll ans = 0;
    cin >> l >> r;

    for(int i=l; i<=r; i++) {
        map<int, int> cnt;
        int x = i;
        while(x > 1) {
            cnt[mpf[x]]++;
            x /= mpf[x];
        }

        ll div = 1;

        for(auto &[d, c] : cnt)
            div *= ((exp(d, c+1) - 1) / (d - 1));

        ans += abs((ll)i - (div - i));
    }

    cout << ans << '\n';
    return 0;
}

Subtask #1
120.0 / 120.0

# 결과 실행 시간 메모리 Grader output
1 Correct 199 ms 49332 KB Output is correct
2 Correct 183 ms 49344 KB Output is correct
3 Correct 208 ms 49328 KB Output is correct
4 Correct 185 ms 49328 KB Output is correct
5 Correct 1134 ms 49484 KB Output is correct
6 Correct 1250 ms 49340 KB Output is correct
7 Correct 1144 ms 49332 KB Output is correct
8 Correct 447 ms 49336 KB Output is correct