Submission #513201

#	Time	Username	Problem	Language	Result	Execution time	Memory
513201		KoD	Euklid (COCI20_euklid)	C++17	110 / 110	1 ms	316 KiB

euklid

#include <bits/stdc++.h>

using std::vector;
using std::array;
using std::pair;
using std::tuple;

using i64 = std::int64_t;

constexpr i64 ceil_div(const i64 a, const i64 b) {
    return (a + b - 1) / b;
}

pair<i64, i64> solve(const i64 G, const i64 H) {
    i64 low = 1, high = 1;
    while (high - low + 1 < G) {
        low = low * H + 0;
        high = high * H + (H - 1);
    }
    i64 a = ceil_div(low, G) * G, b = H;
    return {a, a * b + (a == G ? 0 : G)};
}

i64 edicul(const i64 a, const i64 b) {
    if (a < b) return edicul(b, a);
    if (b == 1) return a;
    return edicul(a / b, b);
}

int main() {
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(nullptr);
    int Q;
    std::cin >> Q;
    while (Q--) {
        i64 G, H;
        std::cin >> G >> H;
        const auto [a, b] = solve(G, H);
        std::cout << a << ' ' << b << '\n';
    }
    return 0;
}

• Subtask 1: 4 / 4
• Subtask 2: 8 / 8
• Subtask 3: 8 / 8
• Subtask 4: 15 / 15
• Subtask 5: 40 / 40
• Subtask 6: 35 / 35