oj.uz

Submission #375244

# Submission time Handle Problem Language Result Execution time Memory
375244 2021-03-09T05:13:23 Z kartel Euklid (COCI20_euklid) C++14
110 / 110
 592 ms 520 KB 
#include <bits/stdc++.h>
#define in(x) freopen(x, "r", stdin)
#define out(x) freopen(x, "w", stdout)
//#include <time.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("-O3")
#define F first
#define S second
#define pb push_back
//#define M ll(1e9 + 7)
#define M ll(998244353)
#define sz(x) (int)x.size()
#define re return
#define oo ll(1e18)
#define el '\n'
#define pii pair <int, int>
#define all(x) (x).begin(), (x).end()
#define arr_all(x, n) (x + 1), (x + 1 + n)
#define vi vector<int>
#define eps (ld)1e-9
using namespace std;
typedef long long ll;
//using namespace __gnu_pbds;
//typedef tree <ll, null_type, less_equal <ll> , rb_tree_tag, tree_order_statistics_node_update> ordered_set;
typedef double ld;
typedef unsigned long long ull;
typedef short int si;

const int N = 2e5 + 500;

ll r(ll x, ll y) {
    if (x > y) {
        swap(x, y);
    }

    if (x == 1)
        return y;
//    cerr << x << " " << y << el;

    return r(x, y / x);
}

bool gd(ll a, ll b) {return (b % a == 0);}

void solve() {
    int g, h;

    cin >> g >> h;

    if (g == h) {
        cout << g << " " << g << el;
        return;
    }

    if (g < h) {
        ll st = g * 1ll * h * ((h + g - 1) / g);
        ll hop = st;

        ll a = st;
        ll b = st * 2ll + g;

        while (1) {
            ll R = r(a, b);
            if (R == h) {
                break;
            }

            if (R == st) {
                assert(0);
                break;
            }

            b += hop;
        }
    //
        cout << a << " " << b << el;
//        cout << r(a, b) << " " << __gcd(a, b)  << el;
        return;
    }

    for (ll k = g * 2; ; k += g) {
        ll a = k * h + g;
        ll b = k;

        if (r(a, b) == h) {
            cout << a << " " << b << el;
            return;
        }
    }
}

int main()
{
//    mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());;
	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
//	in("toys.in");
//	out("toys.out");
//    in("input.txt");
//    out("output.txt");
//    cerr.precision(9); cerr << fixed;

//    clock_t tStart = clock();
    //13 150 = 1950
//    for (ll i = 1950 * 4; i <= 1e6; i += 1950) {
//        cout << 1950 * 4 << " " << i << " -> " << r(1950 * 4, i) << el;
//    }
//
    int q;
    cin >> q;

    while (q--) {
        solve();
    }
}


/*

7
4 6 7 2 3 1 5
*/

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

Subtask #4
15.0 / 15.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 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct

Subtask #5
40.0 / 40.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 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 1 ms 364 KB Output is correct
12 Correct 2 ms 364 KB Output is correct
13 Correct 2 ms 364 KB Output is correct
14 Correct 4 ms 364 KB Output is correct
15 Correct 3 ms 364 KB Output is correct
16 Correct 5 ms 364 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 4 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 4 ms 364 KB Output is correct
22 Correct 4 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 2 ms 364 KB Output is correct
25 Correct 4 ms 364 KB Output is correct
26 Correct 4 ms 364 KB Output is correct
27 Correct 4 ms 364 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 2 ms 384 KB Output is correct
31 Correct 3 ms 364 KB Output is correct
32 Correct 1 ms 364 KB Output is correct

Subtask #6
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 392 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 364 KB Output is correct
9 Correct 0 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 392 KB Output is correct
12 Correct 1 ms 392 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 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 2 ms 364 KB Output is correct
35 Correct 2 ms 364 KB Output is correct
36 Correct 4 ms 364 KB Output is correct
37 Correct 3 ms 364 KB Output is correct
38 Correct 5 ms 364 KB Output is correct
39 Correct 2 ms 384 KB Output is correct
40 Correct 4 ms 364 KB Output is correct
41 Correct 1 ms 364 KB Output is correct
42 Correct 1 ms 364 KB Output is correct
43 Correct 4 ms 364 KB Output is correct
44 Correct 4 ms 364 KB Output is correct
45 Correct 1 ms 364 KB Output is correct
46 Correct 2 ms 364 KB Output is correct
47 Correct 4 ms 364 KB Output is correct
48 Correct 4 ms 364 KB Output is correct
49 Correct 4 ms 364 KB Output is correct
50 Correct 1 ms 364 KB Output is correct
51 Correct 1 ms 364 KB Output is correct
52 Correct 2 ms 384 KB Output is correct
53 Correct 3 ms 364 KB Output is correct
54 Correct 1 ms 364 KB Output is correct
55 Correct 34 ms 364 KB Output is correct
56 Correct 181 ms 364 KB Output is correct
57 Correct 225 ms 492 KB Output is correct
58 Correct 45 ms 392 KB Output is correct
59 Correct 1 ms 364 KB Output is correct
60 Correct 449 ms 392 KB Output is correct
61 Correct 379 ms 364 KB Output is correct
62 Correct 592 ms 520 KB Output is correct
63 Correct 514 ms 492 KB Output is correct
64 Correct 252 ms 492 KB Output is correct
65 Correct 204 ms 364 KB Output is correct
66 Correct 1 ms 364 KB Output is correct
67 Correct 1 ms 364 KB Output is correct
68 Correct 252 ms 492 KB Output is correct
69 Correct 120 ms 492 KB Output is correct
70 Correct 501 ms 492 KB Output is correct
71 Correct 484 ms 364 KB Output is correct
72 Correct 1 ms 364 KB Output is correct
73 Correct 46 ms 492 KB Output is correct
74 Correct 181 ms 392 KB Output is correct
75 Correct 302 ms 492 KB Output is correct
76 Correct 9 ms 364 KB Output is correct