Квадраты и кубы 2.0

// 70 https://informatics.mccme.ru/mod/statements/view3.php?id=30793&chapterid=113758#1

# include <iostream>
# include <cmath>

using namespace std;

uint64_t pow2(uint64_t n) {
    uint64_t left = 1;
    uint64_t right = n;
    while (right - left > 1) {
        uint64_t mid = (left + right) / 2;
        if (mid * mid > n) {
            right = mid;
        } else {
            left = mid;
        }
    }
    return left;
}

uint64_t pow2_ceil(int64_t n) {
    if (n < 1) {
        return 1;
    }
    uint64_t left = 1;
    uint64_t right = n;
    while (right - left > 1) {
        uint64_t mid = (left + right) / 2;
        if (mid * mid < n) {
            left = mid;
        } else {
            right = mid;
        }
    }
    return right;
}

uint64_t pow3(uint64_t n) {
    uint64_t left = 1;
    uint64_t right = n;
    while (right - left > 1) {
        uint64_t mid = (left + right) / 2;
        if (mid * mid * mid > n) {
            right = mid;
        } else {
            left = mid;
        }
    }
    return left;
}

uint64_t pow3_ceil(uint64_t n) {
    uint64_t left = 1;
    uint64_t right = n;
    while (right - left > 1) {
        uint64_t mid = (left + right) / 2;
        if (mid * mid * mid < n) {
            left = mid;
        } else {
            right = mid;
        }
    }
    return right;
}

int main() {
    int64_t a, b, k;
    cin >> a;
    cin >> b;
    cin >> k;
    int64_t res = 0;
    int64_t null = 0;
    uint64_t pow_a = pow2_ceil(a);
    uint64_t pow_b = pow2(b);
    for (size_t i = pow3_ceil(a); i <= pow3(b); i++) {
        int64_t left = max(pow2_ceil(i * i * i - k), pow_a);
        int64_t right = min(pow2(i * i * i + k), pow_b);
        res += max(right - left + 1, null);
    }
    cout << res;
    return 0;
}