/// isA AC
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
void ACPLS()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
#define tc \
int tttttt,subtask; \
cin >> tttttt /*>> subtask*/; \
while (tttttt--)
#define sumrange(l, r, arr) (l == 0 ? arr[r] : arr[r] - arr[l - 1])
#define all(v) v.begin(), v.end()
ll GCDAC(ll a, ll b)
{
if(b==0)
return a;
return GCDAC(b, a%b);
}
ll gcd(ll a, ll b)
{
if(a<b)swap(a,b);
return GCDAC(a, b);
}
int dp[(int)1e3+3][(int)1e3+3];
int R(int a, int b){
if(dp[a][b]!=-1)
return dp[a][b];
if(a<b)
return dp[a][b]=R(b,a);
if(a>=b&&b>1)
return dp[a][b]=R(a/b,b);
return dp[a][b]=a;
}
int main()
{
ACPLS();
memset(dp,-1,sizeof(dp));
tc{
int g,h;
cin>>g>>h;
for(int a = g; a <= 1000; a+=g){
bool flag=0;
for(int b = g; b <= 1000; b+=g){
if(gcd(a,b)==g&&R(a,b)==h){
cout<<a<<' '<<b<<'\n';
flag=1;
break;
}
}
if(flag)break;
}
}
}
Compilation message
euklid.cpp: In function 'int main()':
euklid.cpp:12:16: warning: unused variable 'subtask' [-Wunused-variable]
12 | int tttttt,subtask; \
| ^~~~~~~
euklid.cpp:43:1: note: in expansion of macro 'tc'
43 | tc{
| ^~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
4172 KB |
Output is correct |
2 |
Incorrect |
3 ms |
4172 KB |
Unexpected end of file - int64 expected |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
4248 KB |
Output is correct |
2 |
Correct |
2 ms |
4172 KB |
Output is correct |
3 |
Incorrect |
3 ms |
4172 KB |
Unexpected end of file - int64 expected |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
4172 KB |
Unexpected end of file - int64 expected |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
4172 KB |
Output is correct |
2 |
Correct |
3 ms |
4172 KB |
Output is correct |
3 |
Correct |
4 ms |
4252 KB |
Output is correct |
4 |
Correct |
2 ms |
4172 KB |
Output is correct |
5 |
Correct |
3 ms |
4172 KB |
Output is correct |
6 |
Correct |
3 ms |
4172 KB |
Output is correct |
7 |
Correct |
2 ms |
4172 KB |
Output is correct |
8 |
Correct |
3 ms |
4172 KB |
Output is correct |
9 |
Correct |
3 ms |
4252 KB |
Output is correct |
10 |
Incorrect |
3 ms |
4172 KB |
Output isn't correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
4172 KB |
Output is correct |
2 |
Correct |
3 ms |
4172 KB |
Output is correct |
3 |
Correct |
4 ms |
4252 KB |
Output is correct |
4 |
Correct |
2 ms |
4172 KB |
Output is correct |
5 |
Correct |
3 ms |
4172 KB |
Output is correct |
6 |
Correct |
3 ms |
4172 KB |
Output is correct |
7 |
Correct |
2 ms |
4172 KB |
Output is correct |
8 |
Correct |
3 ms |
4172 KB |
Output is correct |
9 |
Correct |
3 ms |
4252 KB |
Output is correct |
10 |
Incorrect |
3 ms |
4172 KB |
Output isn't correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
4172 KB |
Output is correct |
2 |
Incorrect |
3 ms |
4172 KB |
Unexpected end of file - int64 expected |
3 |
Halted |
0 ms |
0 KB |
- |