Submission #487733

#TimeUsernameProblemLanguageResultExecution timeMemory
487733ngpin04Euklid (COCI20_euklid)C++14
110 / 110
1 ms320 KiB
#include <bits/stdc++.h> #define fi first #define se second #define mp make_pair #define TASK "" #define ALL(x) (x).begin(), (x).end() using namespace std; template <typename T1, typename T2> bool mini(T1 &a, T2 b) { if (a > b) {a = b; return true;} return false; } template <typename T1, typename T2> bool maxi(T1 &a, T2 b) { if (a < b) {a = b; return true;} return false; } const int N = 1e5 + 5; const int oo = 1e9; const long long ooo = 1e18; const int mod = 1e9 + 7; // 998244353; const long double pi = acos(-1); long long r(long long a, long long b) { if (a < b) return r(b, a); if (b == 1) return a; return r(a / b, b); } void solve() { int h,g; cin >> g >> h; long long k = h; while (k <= g) k *= h; // cerr << k << " "; long long b = ((k - 1) / g + 1) * g; long long a = h * b + g; // assert(__gcd(a, b) == g); // assert(r(a, b) == h); cout << a << " " << b << endl; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); #ifdef ONLINE_JUDGE // freopen(TASK".inp","r",stdin); // freopen(TASK".out","w",stdout); #endif int t; cin >> t; while (t--) solve(); 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...