Submission #337153

#TimeUsernameProblemLanguageResultExecution timeMemory
337153nekiEuklid (COCI20_euklid)C++14
110 / 110
1 ms384 KiB
#include <bits/stdc++.h> #define loop(i, a, b) for(long long i=a;i<b;i++) #define pool(i, a, b) for(long long i=a-1;i>=b;i--) #define fore(i, a) for(auto&& i:a) #define fi first #define se second #define ps(a) push_back(a) #define pb(a) pop_back(a) #define sc scanf #define vc vector #define pa pair<ll, ll> #define ll long long #define lb lower_bound #define ub upper_bound #define all(a) a.begin(), a.end() #define llmax LLONG_MAX/2 #define llmin -LLONG_MAX/2 using namespace std; #define mn 401000 #define pa pair<ll, ll> #define ld long double #define mod 1000000007 ll a[mn], b[mn], fu[mn], in[mn]; void solve(){ ll g, h;cin >> g>>h; ll a=1, b=h; while(a<=g) a*=b; b=((a - 1 )/g + 1) * g; a=b * h + g; cout << a << " "<< b<<endl; } int main() { ll t;cin >> t; loop(i, 0, t) solve(); }
#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...