#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,popcnt,sse4,abm")
#include<bits/stdc++.h>
//#pragma GCC target("popcnt")
using namespace std;
//#define int long long
#define X first
#define Y second
int G;int H;
int ttt;
int ek(int a,int b){
if(a<b){return ek(b,a);}
if(b==1){return a;}
return ek(a/b,b);
}
vector<pair<int,int>>co;
void solve(){
cin>>G>>H;
/*
for(int i=1;i<=3000;i++){
for(int j=1;j<=4000;j++){
if(ek(i*G,j*G)==H&&__gcd(i,j)==1){
cout<<i*G<<" "<<j*G<<endl;return;
}
}
}*/
for(int i=0;i<co.size();i++){
int a=G*co[i].first;int b=G*co[i].second;
if(ek(a,b)==H){
cout<<a<<" "<<b<<endl;return;
}
}
}
int dp[2000006];
signed main()
{
cin.tie(0);
ios_base::sync_with_stdio(0);
for(int i=1;i<=30000;i++){
for(int j=1;j<=300;j++){
if(__gcd(i,j)==1){
co.push_back({i,j});
}
}
}
cin>>ttt;
while(ttt--)solve();
}
Compilation message
euklid.cpp: In function 'void solve()':
euklid.cpp:30:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
30 | for(int i=0;i<co.size();i++){
| ~^~~~~~~~~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
309 ms |
66000 KB |
Output is correct |
2 |
Correct |
315 ms |
66116 KB |
Output is correct |
3 |
Correct |
313 ms |
66012 KB |
Output is correct |
4 |
Correct |
311 ms |
66120 KB |
Output is correct |
5 |
Correct |
311 ms |
66024 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
307 ms |
66048 KB |
Output is correct |
2 |
Correct |
307 ms |
66020 KB |
Output is correct |
3 |
Correct |
309 ms |
66096 KB |
Output is correct |
4 |
Correct |
308 ms |
66068 KB |
Output is correct |
5 |
Correct |
304 ms |
66040 KB |
Output is correct |
6 |
Correct |
312 ms |
66016 KB |
Output is correct |
7 |
Correct |
307 ms |
66012 KB |
Output is correct |
8 |
Correct |
310 ms |
66092 KB |
Output is correct |
9 |
Correct |
307 ms |
66056 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
307 ms |
66000 KB |
Output is correct |
2 |
Correct |
340 ms |
66016 KB |
Output is correct |
3 |
Correct |
307 ms |
66076 KB |
Output is correct |
4 |
Correct |
306 ms |
66096 KB |
Output is correct |
5 |
Correct |
307 ms |
66028 KB |
Output is correct |
6 |
Correct |
308 ms |
66052 KB |
Output is correct |
7 |
Correct |
306 ms |
66060 KB |
Output is correct |
8 |
Correct |
315 ms |
66136 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
308 ms |
66108 KB |
Output is correct |
2 |
Correct |
309 ms |
66028 KB |
Output is correct |
3 |
Correct |
307 ms |
66112 KB |
Output is correct |
4 |
Correct |
306 ms |
66028 KB |
Output is correct |
5 |
Correct |
306 ms |
66164 KB |
Output is correct |
6 |
Correct |
308 ms |
66080 KB |
Output is correct |
7 |
Correct |
309 ms |
66092 KB |
Output is correct |
8 |
Correct |
309 ms |
66096 KB |
Output is correct |
9 |
Correct |
306 ms |
66064 KB |
Output is correct |
10 |
Correct |
308 ms |
66188 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
308 ms |
66108 KB |
Output is correct |
2 |
Correct |
309 ms |
66028 KB |
Output is correct |
3 |
Correct |
307 ms |
66112 KB |
Output is correct |
4 |
Correct |
306 ms |
66028 KB |
Output is correct |
5 |
Correct |
306 ms |
66164 KB |
Output is correct |
6 |
Correct |
308 ms |
66080 KB |
Output is correct |
7 |
Correct |
309 ms |
66092 KB |
Output is correct |
8 |
Correct |
309 ms |
66096 KB |
Output is correct |
9 |
Correct |
306 ms |
66064 KB |
Output is correct |
10 |
Correct |
308 ms |
66188 KB |
Output is correct |
11 |
Correct |
399 ms |
66096 KB |
Output is correct |
12 |
Execution timed out |
1085 ms |
66100 KB |
Time limit exceeded |
13 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
309 ms |
66000 KB |
Output is correct |
2 |
Correct |
315 ms |
66116 KB |
Output is correct |
3 |
Correct |
313 ms |
66012 KB |
Output is correct |
4 |
Correct |
311 ms |
66120 KB |
Output is correct |
5 |
Correct |
311 ms |
66024 KB |
Output is correct |
6 |
Correct |
307 ms |
66048 KB |
Output is correct |
7 |
Correct |
307 ms |
66020 KB |
Output is correct |
8 |
Correct |
309 ms |
66096 KB |
Output is correct |
9 |
Correct |
308 ms |
66068 KB |
Output is correct |
10 |
Correct |
304 ms |
66040 KB |
Output is correct |
11 |
Correct |
312 ms |
66016 KB |
Output is correct |
12 |
Correct |
307 ms |
66012 KB |
Output is correct |
13 |
Correct |
310 ms |
66092 KB |
Output is correct |
14 |
Correct |
307 ms |
66056 KB |
Output is correct |
15 |
Correct |
307 ms |
66000 KB |
Output is correct |
16 |
Correct |
340 ms |
66016 KB |
Output is correct |
17 |
Correct |
307 ms |
66076 KB |
Output is correct |
18 |
Correct |
306 ms |
66096 KB |
Output is correct |
19 |
Correct |
307 ms |
66028 KB |
Output is correct |
20 |
Correct |
308 ms |
66052 KB |
Output is correct |
21 |
Correct |
306 ms |
66060 KB |
Output is correct |
22 |
Correct |
315 ms |
66136 KB |
Output is correct |
23 |
Correct |
308 ms |
66108 KB |
Output is correct |
24 |
Correct |
309 ms |
66028 KB |
Output is correct |
25 |
Correct |
307 ms |
66112 KB |
Output is correct |
26 |
Correct |
306 ms |
66028 KB |
Output is correct |
27 |
Correct |
306 ms |
66164 KB |
Output is correct |
28 |
Correct |
308 ms |
66080 KB |
Output is correct |
29 |
Correct |
309 ms |
66092 KB |
Output is correct |
30 |
Correct |
309 ms |
66096 KB |
Output is correct |
31 |
Correct |
306 ms |
66064 KB |
Output is correct |
32 |
Correct |
308 ms |
66188 KB |
Output is correct |
33 |
Correct |
399 ms |
66096 KB |
Output is correct |
34 |
Execution timed out |
1085 ms |
66100 KB |
Time limit exceeded |
35 |
Halted |
0 ms |
0 KB |
- |