이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include<bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define int long long
using namespace std;
const int N = 2e5 + 5;
const int mod = 1e9+7;
const int inf = 1e18 + 10;
const int L = 20 * 20 * 20;
int gcd(int a, int b){
if(a < b) swap(a, b);
if(b == 0) return a;
return gcd(b, a%b);
}
int r(int a, int b){
if(a < b) swap(a, b);
if(b == 1) return a;
return r(a/b, b);
}
int32_t main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
int t;
cin>>t;
while(t--){
int g, h;
cin>>g>>h;
if(g == h){
cout<<g<<" "<<g<<endl;
continue;
}
int a = g * (h/g + 1);
int b = -1;
for(int i = g; i <= N; i += g){
if(gcd(i, a) == g && r(i, a) == h){
b = i;
break;
}
}
cout<<a<<" "<<b<<endl;
//if(b == -1) cout<<"ah be"<<endl;
//else if(gcd(a, b) == g && r(a, b) == h) cout<<1<<endl;
//else cout<<0<<endl;
/*
for(int i = g; i <= 200; i += g){
for(int j = i; j <= 200; j += g){
if(gcd(i, j) == g && r(i, j) == h){
cout<<i<<" "<<j<<endl;
}
}
}
*/
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |