oj.uz

Submission #332247

# Submission time Handle Problem Language Result Execution time Memory
332247 2020-12-01T18:59:21 Z DanerZein Euklid (COCI20_euklid) C++14
27 / 110
 1000 ms 492 KB 
#include <bits/stdc++.h>
using namespace std;
int gcd(int a,int b){
  if(b==0) return a;
  return gcd(b,a%b);
}
int R(int a,int b){
  if(b>a) swap(a,b);
  if(b==1) return a;
  if(a==1) return b;
  return R(a/b,b);
}
int main(){
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int t;
  cin>>t;
  while(t--){
    int g,h;
    cin>>g>>h;
    if(g==h){
      cout<<g<<" "<<h<<endl;
      continue;
    }
    if(h==2){
      cout<<g<<" "<<2*g<<endl;
      continue;
    }
    bool sw=0;
    for(int i=1;i<=10000;i++){
      for(int j=1;j<=10000;j++){
	if(R(i,j)==h && g==gcd(i,j)){
	  cout<<i<<" "<<j<<endl;
	  sw=1;
	  break;
	}
      }
      if(sw) break;
    }
  }
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct

Subtask #3
0 / 8.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1091 ms 364 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 64 ms 492 KB Output is correct
2 Correct 133 ms 364 KB Output is correct
3 Correct 142 ms 364 KB Output is correct
4 Correct 160 ms 492 KB Output is correct
5 Correct 166 ms 364 KB Output is correct
6 Correct 191 ms 364 KB Output is correct
7 Correct 224 ms 364 KB Output is correct
8 Correct 253 ms 364 KB Output is correct
9 Correct 274 ms 364 KB Output is correct
10 Correct 316 ms 364 KB Output is correct

Subtask #5
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 64 ms 492 KB Output is correct
2 Correct 133 ms 364 KB Output is correct
3 Correct 142 ms 364 KB Output is correct
4 Correct 160 ms 492 KB Output is correct
5 Correct 166 ms 364 KB Output is correct
6 Correct 191 ms 364 KB Output is correct
7 Correct 224 ms 364 KB Output is correct
8 Correct 253 ms 364 KB Output is correct
9 Correct 274 ms 364 KB Output is correct
10 Correct 316 ms 364 KB Output is correct
11 Execution timed out 1092 ms 364 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Execution timed out 1091 ms 364 KB Time limit exceeded
16 Halted 0 ms 0 KB -