Submission #630151

#TimeUsernameProblemLanguageResultExecution timeMemory
630151Hacv16Euklid (COCI20_euklid)C++17
15 / 110
1075 ms300 KiB
#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;

const int MAX = 2e6 + 15;
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;

#define pb push_back
#define sz(x) (int) x.size()
#define fr first
#define sc second
#define mp make_pair
#define all(x) x.begin(), x.end()
#define dbg(x) cerr << #x << ": " << "[ " << x << " ]\n"

ll r(ll a, ll b){
    if(a < b) return r(b, a);
    if(b > 1) return r(a / b, b);
    return a;
}

void find(ll a, ll b){
    for(ll i = a; i <= 10000; i++){
        for(ll j = a; j <= 10000; j++){
            if(__gcd(i, j) == a && r(i, j) == b){
                cout << i << ' ' << j << '\n';
                return;
            }
        }
    }
}

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

    int tc; cin >> tc;

    while(tc--){
        ll a, b; cin >> a >> b;
        find(a, b);        
    }

    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...