Submission #334702

#TimeUsernameProblemLanguageResultExecution timeMemory
334702nikatamlianiEuklid (COCI20_euklid)C++14
110 / 110
1 ms492 KiB
#include <bits/stdc++.h> using namespace std; const int N = 2e5+10; #define ll long long int main() { int t; cin >> t; auto is_good = [&](ll x, ll g, ll h) { if(x <= max(g, h)) return false; if(x % g == 0) { while(x >= h) { x /= h; } return x == 1; } else { return false; } }; while(t--) { ll g, h, p = 1; cin >> g >> h; while(!is_good(p + (g - p % g) % g, g, h)) { p *= h; } ll x = p + (g - p % g) % g; ll y = h * x + g; cout << x << ' ' << y << '\n'; } }
#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...