#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 20000;
inline int rand(int l, int r){
static mt19937
rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_int_distribution<int> ludo(l, r);
return ludo(rng);
}
inline int R(int a, int b){
if(a < b)return R(b,a);
else if(a >= b and b > 1)return R(a/b,b);
else return a;
}
void solve(){
int g,h;
cin >> g >> h;
if(g == h)cout << h << " " << h << endl;
else if(h == 2)cout << 2*g << " " << g << endl;
else if(g == (h*h))cout << h*h << " " << h*h*h << endl;
else{
for(int i = 1;i<=N;i++){
for(int j = i+1;j<=N;j++){
if(__gcd(i,j) == 1 and R(i*g,j*g) == h){
cout << i*g << " " << j*g << endl;
return;
}
}
}
}
}
signed main(){
ios_base::sync_with_stdio(0);cin.tie(0);
int testcase = 1;cin >> testcase;
while(testcase--)solve();
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
Output is correct |
| 2 |
Correct |
1 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Correct |
0 ms |
348 KB |
Output is correct |
| 5 |
Correct |
0 ms |
348 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Correct |
0 ms |
348 KB |
Output is correct |
| 5 |
Correct |
0 ms |
348 KB |
Output is correct |
| 6 |
Correct |
0 ms |
348 KB |
Output is correct |
| 7 |
Correct |
1 ms |
348 KB |
Output is correct |
| 8 |
Correct |
0 ms |
348 KB |
Output is correct |
| 9 |
Correct |
0 ms |
348 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Correct |
0 ms |
348 KB |
Output is correct |
| 5 |
Correct |
0 ms |
348 KB |
Output is correct |
| 6 |
Correct |
0 ms |
348 KB |
Output is correct |
| 7 |
Correct |
0 ms |
348 KB |
Output is correct |
| 8 |
Correct |
0 ms |
348 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
74 ms |
348 KB |
Output is correct |
| 2 |
Correct |
73 ms |
348 KB |
Output is correct |
| 3 |
Correct |
41 ms |
344 KB |
Output is correct |
| 4 |
Correct |
29 ms |
348 KB |
Output is correct |
| 5 |
Correct |
21 ms |
344 KB |
Output is correct |
| 6 |
Correct |
19 ms |
344 KB |
Output is correct |
| 7 |
Correct |
19 ms |
344 KB |
Output is correct |
| 8 |
Correct |
18 ms |
344 KB |
Output is correct |
| 9 |
Correct |
17 ms |
348 KB |
Output is correct |
| 10 |
Correct |
18 ms |
348 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
74 ms |
348 KB |
Output is correct |
| 2 |
Correct |
73 ms |
348 KB |
Output is correct |
| 3 |
Correct |
41 ms |
344 KB |
Output is correct |
| 4 |
Correct |
29 ms |
348 KB |
Output is correct |
| 5 |
Correct |
21 ms |
344 KB |
Output is correct |
| 6 |
Correct |
19 ms |
344 KB |
Output is correct |
| 7 |
Correct |
19 ms |
344 KB |
Output is correct |
| 8 |
Correct |
18 ms |
344 KB |
Output is correct |
| 9 |
Correct |
17 ms |
348 KB |
Output is correct |
| 10 |
Correct |
18 ms |
348 KB |
Output is correct |
| 11 |
Correct |
23 ms |
348 KB |
Output is correct |
| 12 |
Execution timed out |
1073 ms |
348 KB |
Time limit exceeded |
| 13 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
Output is correct |
| 2 |
Correct |
1 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Correct |
0 ms |
348 KB |
Output is correct |
| 5 |
Correct |
0 ms |
348 KB |
Output is correct |
| 6 |
Correct |
0 ms |
348 KB |
Output is correct |
| 7 |
Correct |
0 ms |
348 KB |
Output is correct |
| 8 |
Correct |
0 ms |
348 KB |
Output is correct |
| 9 |
Correct |
0 ms |
348 KB |
Output is correct |
| 10 |
Correct |
0 ms |
348 KB |
Output is correct |
| 11 |
Correct |
0 ms |
348 KB |
Output is correct |
| 12 |
Correct |
1 ms |
348 KB |
Output is correct |
| 13 |
Correct |
0 ms |
348 KB |
Output is correct |
| 14 |
Correct |
0 ms |
348 KB |
Output is correct |
| 15 |
Correct |
0 ms |
348 KB |
Output is correct |
| 16 |
Correct |
0 ms |
348 KB |
Output is correct |
| 17 |
Correct |
0 ms |
348 KB |
Output is correct |
| 18 |
Correct |
0 ms |
348 KB |
Output is correct |
| 19 |
Correct |
0 ms |
348 KB |
Output is correct |
| 20 |
Correct |
0 ms |
348 KB |
Output is correct |
| 21 |
Correct |
0 ms |
348 KB |
Output is correct |
| 22 |
Correct |
0 ms |
348 KB |
Output is correct |
| 23 |
Correct |
74 ms |
348 KB |
Output is correct |
| 24 |
Correct |
73 ms |
348 KB |
Output is correct |
| 25 |
Correct |
41 ms |
344 KB |
Output is correct |
| 26 |
Correct |
29 ms |
348 KB |
Output is correct |
| 27 |
Correct |
21 ms |
344 KB |
Output is correct |
| 28 |
Correct |
19 ms |
344 KB |
Output is correct |
| 29 |
Correct |
19 ms |
344 KB |
Output is correct |
| 30 |
Correct |
18 ms |
344 KB |
Output is correct |
| 31 |
Correct |
17 ms |
348 KB |
Output is correct |
| 32 |
Correct |
18 ms |
348 KB |
Output is correct |
| 33 |
Correct |
23 ms |
348 KB |
Output is correct |
| 34 |
Execution timed out |
1073 ms |
348 KB |
Time limit exceeded |
| 35 |
Halted |
0 ms |
0 KB |
- |
