#include <bits/stdc++.h>
using namespace std;
typedef long double ld;
typedef long long ll;
const ld E = 1e-9;
const int N = 1010;
ll h, g;
ll R(ll a, ll b){
if (b > a)
return R(b, a);
if (b == 1) return a;
return R(a / b, b);
}
int main(){
ios_base::sync_with_stdio(0); cin.tie(0);
#ifdef _LOCAL
freopen("in.txt","r",stdin);
#endif // _LOCAL
int qq; cin >> qq;
for (; qq; qq--){
cin >> g >> h;
bool was = 0;
for (int i = 1; i <= 1000 && !was; i++)
for (int j = 1; j <= 1000 && !was; j++)
if (__gcd(i, j) == g && R(i, j) == h){
cout << i << " " << j << '\n';
was = 1;
break;
}
// for (ll i = g; ; i += g){
// for (ll i = 1; ; i++){
// if (R(i, g) == h){
// cout << g << " " << i << '\n';
// break;
// }
// }
}
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
19 ms |
388 KB |
Output is correct |
2 |
Execution timed out |
1082 ms |
364 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
20 ms |
364 KB |
Output is correct |
2 |
Correct |
148 ms |
364 KB |
Output is correct |
3 |
Execution timed out |
1086 ms |
364 KB |
Time limit exceeded |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
1055 ms |
364 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
5 ms |
364 KB |
Output is correct |
2 |
Correct |
10 ms |
364 KB |
Output is correct |
3 |
Correct |
10 ms |
364 KB |
Output is correct |
4 |
Correct |
11 ms |
364 KB |
Output is correct |
5 |
Correct |
13 ms |
364 KB |
Output is correct |
6 |
Correct |
16 ms |
364 KB |
Output is correct |
7 |
Correct |
18 ms |
364 KB |
Output is correct |
8 |
Correct |
22 ms |
364 KB |
Output is correct |
9 |
Correct |
26 ms |
512 KB |
Output is correct |
10 |
Incorrect |
69 ms |
492 KB |
Output isn't correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
5 ms |
364 KB |
Output is correct |
2 |
Correct |
10 ms |
364 KB |
Output is correct |
3 |
Correct |
10 ms |
364 KB |
Output is correct |
4 |
Correct |
11 ms |
364 KB |
Output is correct |
5 |
Correct |
13 ms |
364 KB |
Output is correct |
6 |
Correct |
16 ms |
364 KB |
Output is correct |
7 |
Correct |
18 ms |
364 KB |
Output is correct |
8 |
Correct |
22 ms |
364 KB |
Output is correct |
9 |
Correct |
26 ms |
512 KB |
Output is correct |
10 |
Incorrect |
69 ms |
492 KB |
Output isn't correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
19 ms |
388 KB |
Output is correct |
2 |
Execution timed out |
1082 ms |
364 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |