Submission #336213

#	Time	Username	Problem	Language	Result	Execution time	Memory
336213		wiwiho	Euklid (COCI20_euklid)	C++14	35 / 110	631 ms	9488 KiB

euklid

#include<bits/stdc++.h>

#define iter(a) a.begin(), a.end()
#define pll pair<ll, ll>
#define pii pair<int, int>
#define mp make_pair
#define F first
#define S second
#define lsort(a) sort(iter(a))
#define eb emplace_back
#define gsort(a) sort(iter(a), greater<>());

using namespace std;

typedef long long ll;

ll R(ll a, ll b){
    while(b > 1){
        if(a < b) swap(a, b);
        a /= b;
        //cerr << a << " " << b << "\n";
    }
    return a;
}

vector<ll> lpd, prime;

void sieve(int n){
    lpd.resize(n + 1, 1);
    for(int i = 2; i <= n; i++){
        if(lpd[i] == 1){
            prime.eb(i);
            lpd[i] = i;
        }
        for(ll j : prime){
            if(i * j > n) break;
            lpd[i * j] = j;
            if(j == lpd[i]) break;
        }
    }
}

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    sieve(1000000);

    int T;
    cin >> T;
    while(T--){
        ll g, h;
        cin >> g >> h;

        ll a = -1, b = -1;
        if(g == h){
            a = b = g;
        }
        else if(h == 2){
            a = g * 2;
            b = g;
        }
        else if(g == h * h){
            a = g * h;
            b = g;
        }
        else{
            for(ll i = 1; i <= 2000; i++){
                for(ll j = 1; j <= 2000; j++){
                    if(__gcd(i, j) == 1 && R(g * i, g * j) == h){
                        a = g * i, b = g * j;
                        goto ok;
                    }
                }
            }
        }
        ok:;

        //assert(__gcd(a, b) == g && R(a, b) == h);
        cout << a << " " << b << "\n";

    }

    return 0;
}

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