#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){
if(a == b){
cout << a << ' ' << b << '\n';
return;
}
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;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
328 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
5 |
Correct |
0 ms |
212 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Incorrect |
0 ms |
212 KB |
Unexpected end of file - int64 expected |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
1096 ms |
212 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
44 ms |
212 KB |
Output is correct |
2 |
Correct |
70 ms |
212 KB |
Output is correct |
3 |
Correct |
62 ms |
292 KB |
Output is correct |
4 |
Correct |
62 ms |
292 KB |
Output is correct |
5 |
Correct |
58 ms |
296 KB |
Output is correct |
6 |
Correct |
65 ms |
300 KB |
Output is correct |
7 |
Correct |
74 ms |
296 KB |
Output is correct |
8 |
Correct |
91 ms |
212 KB |
Output is correct |
9 |
Correct |
105 ms |
296 KB |
Output is correct |
10 |
Correct |
147 ms |
212 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
44 ms |
212 KB |
Output is correct |
2 |
Correct |
70 ms |
212 KB |
Output is correct |
3 |
Correct |
62 ms |
292 KB |
Output is correct |
4 |
Correct |
62 ms |
292 KB |
Output is correct |
5 |
Correct |
58 ms |
296 KB |
Output is correct |
6 |
Correct |
65 ms |
300 KB |
Output is correct |
7 |
Correct |
74 ms |
296 KB |
Output is correct |
8 |
Correct |
91 ms |
212 KB |
Output is correct |
9 |
Correct |
105 ms |
296 KB |
Output is correct |
10 |
Correct |
147 ms |
212 KB |
Output is correct |
11 |
Execution timed out |
1092 ms |
212 KB |
Time limit exceeded |
12 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
328 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
5 |
Correct |
0 ms |
212 KB |
Output is correct |
6 |
Correct |
1 ms |
212 KB |
Output is correct |
7 |
Correct |
0 ms |
212 KB |
Output is correct |
8 |
Incorrect |
0 ms |
212 KB |
Unexpected end of file - int64 expected |
9 |
Halted |
0 ms |
0 KB |
- |