Submission #1047833

#	Time	Username	Problem	Language	Result	Execution time	Memory
1047833		FzArK	Euklid (COCI20_euklid)	C++17	75 / 110	1 ms	600 KiB

euklid

#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ll long long
#define sz(x) (int) x.size()
#define all(x) x.begin(), x.end()
#define FAST ios::sync_with_stdio(0); cin.tie(0);
#define getunique(v) {sort(v.begin(), v.end()); v.erase(unique(v.begin(), v.end()), v.end());}
#define random mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count()); mt19937 rnd(time(0));

const int INF = 1e9;
const int MX = 2e5 + 9;
const int MOD = 1e9 + 7;
//const int MOD = 998244353;

void solve() {
    function<ll(ll, ll)> R = [&](ll a, ll b) {
        if (a < b) {
            return R(b, a);
        }
        else if (b == 1) {
            return a;
        }
        else {
            return R(a / b, b);
        }
    };

    ll g, h;
    cin >> g >> h;

    ll x = h, y = 1;
    while (y < g) {
        if (x > y) {
            swap(x, y);
        }
        else {
            x = x * y;
        }
    }
    if (y % g || y == g) {
        if (x > y) {
            swap(x, y);
        }
        x = (x * y + g - 1) / g * g;
    }
    {// make gcd = g
        if (x > y) {
            swap(x, y);
        }
        x = x * y + g;
    }
    assert (R(x, y) == h);
    assert (__gcd(x, y) == g);
    cout << x << " " << y << endl;
}

int main() {
    FAST;
    int t = 1;
    cin >> t;
    while (t--) {
        solve();
    }
}

/*



*/

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