| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 448200 | 2021-07-29T08:59:59 Z | Apiram | Euklid (COCI20_euklid) | C++14 | 1000 ms | 312 KB |
#include<bits/stdc++.h>
using namespace std;
int64_t solve(int a,int b){
if (a==1){
return b;
}
if (b==1)return a;
if (a<b)solve(b/a,a);
else
return solve(a/b, b);
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int test;cin>>test;
while(test--){
int64_t g,h;
cin>>g>>h;
vector<pair<int,int>>ans;
if (g==1){
cout<<1<<" "<<h<<endl;
continue;
}
else if (g==h){
cout<<g<<" "<<h<<endl;
continue;
}
else if (h==2){
cout<<g*2<<" "<<g<<endl;
continue;
}
else if (g==h*h){
cout<<g*h<<" "<<g<<endl;
continue;
}
for (int i = g;i<=200000;i+=g){
for (int j =g;j<=i;j+=g){
if (__gcd(i,j)==g){
if (solve(i,j)==h){
ans.push_back({i,j});
break;
}
}
}
if (!ans.empty())break;
}
cout<<ans[0].first<<" "<<ans[0].second<<endl;
}
return 0;}
Compilation message
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Correct | 1 ms | 204 KB | Output is correct |
| 2 | Correct | 1 ms | 204 KB | Output is correct |
| 3 | Correct | 1 ms | 204 KB | Output is correct |
| 4 | Correct | 1 ms | 204 KB | Output is correct |
| 5 | Correct | 0 ms | 204 KB | Output is correct |
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Correct | 0 ms | 204 KB | Output is correct |
| 2 | Correct | 1 ms | 204 KB | Output is correct |
| 3 | Correct | 1 ms | 204 KB | Output is correct |
| 4 | Correct | 1 ms | 204 KB | Output is correct |
| 5 | Correct | 1 ms | 204 KB | Output is correct |
| 6 | Correct | 0 ms | 204 KB | Output is correct |
| 7 | Correct | 1 ms | 204 KB | Output is correct |
| 8 | Correct | 1 ms | 204 KB | Output is correct |
| 9 | Correct | 1 ms | 204 KB | Output is correct |
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Correct | 1 ms | 204 KB | Output is correct |
| 2 | Correct | 1 ms | 204 KB | Output is correct |
| 3 | Correct | 1 ms | 204 KB | Output is correct |
| 4 | Correct | 1 ms | 204 KB | Output is correct |
| 5 | Correct | 1 ms | 204 KB | Output is correct |
| 6 | Correct | 1 ms | 312 KB | Output is correct |
| 7 | Correct | 1 ms | 204 KB | Output is correct |
| 8 | Correct | 1 ms | 204 KB | Output is correct |
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Execution timed out | 1087 ms | 204 KB | Time limit exceeded |
| 2 | Halted | 0 ms | 0 KB | - |
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Execution timed out | 1087 ms | 204 KB | Time limit exceeded |
| 2 | Halted | 0 ms | 0 KB | - |
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Correct | 1 ms | 204 KB | Output is correct |
| 2 | Correct | 1 ms | 204 KB | Output is correct |
| 3 | Correct | 1 ms | 204 KB | Output is correct |
| 4 | Correct | 1 ms | 204 KB | Output is correct |
| 5 | Correct | 0 ms | 204 KB | Output is correct |
| 6 | Correct | 0 ms | 204 KB | Output is correct |
| 7 | Correct | 1 ms | 204 KB | Output is correct |
| 8 | Correct | 1 ms | 204 KB | Output is correct |
| 9 | Correct | 1 ms | 204 KB | Output is correct |
| 10 | Correct | 1 ms | 204 KB | Output is correct |
| 11 | Correct | 0 ms | 204 KB | Output is correct |
| 12 | Correct | 1 ms | 204 KB | Output is correct |
| 13 | Correct | 1 ms | 204 KB | Output is correct |
| 14 | Correct | 1 ms | 204 KB | Output is correct |
| 15 | Correct | 1 ms | 204 KB | Output is correct |
| 16 | Correct | 1 ms | 204 KB | Output is correct |
| 17 | Correct | 1 ms | 204 KB | Output is correct |
| 18 | Correct | 1 ms | 204 KB | Output is correct |
| 19 | Correct | 1 ms | 204 KB | Output is correct |
| 20 | Correct | 1 ms | 312 KB | Output is correct |
| 21 | Correct | 1 ms | 204 KB | Output is correct |
| 22 | Correct | 1 ms | 204 KB | Output is correct |
| 23 | Execution timed out | 1087 ms | 204 KB | Time limit exceeded |
| 24 | Halted | 0 ms | 0 KB | - |