oj.uz

Submission #336206

# Submission time Handle Problem Language Result Execution time Memory
336206 2020-12-15T02:30:03 Z wiwiho Euklid (COCI20_euklid) C++14
35 / 110
 1000 ms 492 KB 
#include<bits/stdc++.h>

#define iter(a) a.begin(), a.end()
#define pll pair<ll, ll>
#define pii pair<int, int>
#define mp make_pair
#define F first
#define S second
#define lsort(a) sort(iter(a))
#define eb emplace_back
#define gsort(a) sort(iter(a), greater<>());

using namespace std;

typedef long long ll;

ll R(ll a, ll b){
    while(b > 1){
        if(a < b) swap(a, b);
        a /= b;
        //cerr << a << " " << b << "\n";
    }
    return a;
}

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    int T;
    cin >> T;
    while(T--){
        ll g, h;
        cin >> g >> h;

        ll a = -1, b = -1;
        if(g == h){
            a = b = g;
        }
        else if(h == 2){
            a = g * 2;
            b = g;
        }
        else if(g == h * h){
            a = g * h;
            b = g;
        }
        else{
            for(ll i = 1; i <= 5000; i++){
                for(ll j = 1; j <= 5000; j++){
                    if(__gcd(i, j) == g && R(i, j) == h){
                        a = i, b = j;
                        goto ok;
                    }
                }
            }
        }
        ok:;

        //assert(__gcd(a, b) == g && R(a, b) == h);
        cout << a << " " << b << "\n";

    }

    return 0;
}

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 0 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 0 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
8.0 / 8.0

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

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 364 KB Output is correct
2 Correct 46 ms 364 KB Output is correct
3 Correct 48 ms 364 KB Output is correct
4 Correct 55 ms 364 KB Output is correct
5 Correct 58 ms 492 KB Output is correct
6 Correct 70 ms 364 KB Output is correct
7 Correct 85 ms 364 KB Output is correct
8 Correct 103 ms 364 KB Output is correct
9 Correct 121 ms 492 KB Output is correct
10 Correct 151 ms 364 KB Output is correct

Subtask #5
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 364 KB Output is correct
2 Correct 46 ms 364 KB Output is correct
3 Correct 48 ms 364 KB Output is correct
4 Correct 55 ms 364 KB Output is correct
5 Correct 58 ms 492 KB Output is correct
6 Correct 70 ms 364 KB Output is correct
7 Correct 85 ms 364 KB Output is correct
8 Correct 103 ms 364 KB Output is correct
9 Correct 121 ms 492 KB Output is correct
10 Correct 151 ms 364 KB Output is correct
11 Execution timed out 1089 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 0 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 0 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
10 Correct 1 ms 364 KB Output is correct
11 Correct 0 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 Correct 1 ms 364 KB Output is correct
16 Correct 0 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 0 ms 364 KB Output is correct
19 Correct 0 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 0 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 27 ms 364 KB Output is correct
24 Correct 46 ms 364 KB Output is correct
25 Correct 48 ms 364 KB Output is correct
26 Correct 55 ms 364 KB Output is correct
27 Correct 58 ms 492 KB Output is correct
28 Correct 70 ms 364 KB Output is correct
29 Correct 85 ms 364 KB Output is correct
30 Correct 103 ms 364 KB Output is correct
31 Correct 121 ms 492 KB Output is correct
32 Correct 151 ms 364 KB Output is correct
33 Execution timed out 1089 ms 364 KB Time limit exceeded
34 Halted 0 ms 0 KB -