Submission #374466

# Submission time Handle Problem Language Result Execution time Memory
374466 2021-03-07T10:08:55 Z VEGAnn Euklid (COCI20_euklid) C++14
20 / 110
1000 ms 364 KB
#include <bits/stdc++.h>
using namespace std;
typedef long double ld;
typedef long long ll;
const ld E = 1e-9;
const ll N = 2010;
ll h, g;

ll R(ll a, ll b){
    if (min(a, b) == 1) return max(a, b);

    if (b > a)
        return R(b / a, a);
    else return R(a / b, b);
}

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

#ifdef _LOCAL
    freopen("in.txt","r",stdin);
#endif // _LOCAL


//    cerr << R(36, 130) << '\n';
//    cerr << R(38, 137) << '\n';
//    cerr << R(26, 91) << '\n';
//    cerr << R(28, 98) << '\n';
//    cerr << R(40, 120) << '\n';
//
//    return 0;

    ll qq; cin >> qq;

    for (; qq; qq--){
        cin >> g >> h;

        if (h <= g){
            if (g == h){
                cout << g << " " << g << '\n';
                continue;
            }

            ll mx = 1;

            for (ll i = g + g; ; i *= 2) {
                if (R(i, h) == h) {
//                    cout << i << " " << i * h + g << '\n';
                    cout << ll(i) * ll(h) + ll(g) << " " << i << '\n';
                    break;
                }
            }

            continue;
        }

        ll beg = g * ((h + g - 1) / g);

        for (ll i = g; ; i *= 2)
            if (__gcd(i, beg) == g && R(i, beg) == h){
                cout << beg << " " << i << '\n';
                break;
            }
    }

    return 0;
}

Compilation message

euklid.cpp: In function 'int main()':
euklid.cpp:44:16: warning: unused variable 'mx' [-Wunused-variable]
   44 |             ll mx = 1;
      |                ^~
# 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
# Verdict Execution time Memory Grader output
1 Correct 1 ms 268 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 0 ms 364 KB Output is correct
# 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 0 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 0 ms 364 KB Output is correct
# Verdict Execution time Memory Grader output
1 Execution timed out 1076 ms 364 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Execution timed out 1076 ms 364 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# 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 268 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 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 0 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 0 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 0 ms 364 KB Output is correct
23 Execution timed out 1076 ms 364 KB Time limit exceeded
24 Halted 0 ms 0 KB -