oj.uz

Submission #630177

# Submission time Handle Problem Language Result Execution time Memory
630177 2022-08-15T20:19:24 Z Hacv16 Euklid (COCI20_euklid) C++17
27 / 110
 1000 ms 320 KB 
#include<bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef pair<int, int> pii;
 
const int MAX = 2e6 + 15;
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
 
#define pb push_back
#define sz(x) (int) x.size()
#define fr first
#define sc second
#define mp make_pair
#define all(x) x.begin(), x.end()
#define dbg(x) cerr << #x << ": " << "[ " << x << " ]\n"
 
ll r(ll a, ll b){
    if(a < b) return r(b, a);
    if(b > 1) return r(a / b, b);
    return a;
}
 
void find(ll a, ll b){
    if(a == b){
        cout << a << ' ' << b << '\n';
        return;
    }

    if(b == 2){
        cout << a << ' ' << 2 * a << '\n';
        return;
    }

    for(ll i = a; i <= 10000; i++){
        for(ll j = a; j <= 10000; j++){
            if(__gcd(i, j) == a && r(i, j) == b){
                cout << i << ' ' << j << '\n';
                return;
            }
        }
    }
}
 
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL); 
 
    int tc; cin >> tc;
 
    while(tc--){
        ll a, b; cin >> a >> b;
        find(a, b);        
    }
 
    return 0;
}

Subtask #1
4.0 / 4.0

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

Subtask #2
8.0 / 8.0

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

Subtask #3
0 / 8.0

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

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 304 KB Output is correct
2 Correct 68 ms 300 KB Output is correct
3 Correct 62 ms 300 KB Output is correct
4 Correct 60 ms 300 KB Output is correct
5 Correct 56 ms 212 KB Output is correct
6 Correct 64 ms 300 KB Output is correct
7 Correct 76 ms 300 KB Output is correct
8 Correct 90 ms 300 KB Output is correct
9 Correct 105 ms 308 KB Output is correct
10 Correct 144 ms 212 KB Output is correct

Subtask #5
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 304 KB Output is correct
2 Correct 68 ms 300 KB Output is correct
3 Correct 62 ms 300 KB Output is correct
4 Correct 60 ms 300 KB Output is correct
5 Correct 56 ms 212 KB Output is correct
6 Correct 64 ms 300 KB Output is correct
7 Correct 76 ms 300 KB Output is correct
8 Correct 90 ms 300 KB Output is correct
9 Correct 105 ms 308 KB Output is correct
10 Correct 144 ms 212 KB Output is correct
11 Execution timed out 1089 ms 212 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

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