Submission #374382

#	Time	Username	Problem	Language	Result	Execution time	Memory
374382		Vimmer	Euklid (COCI20_euklid)	C++14	4 / 110	1 ms	364 KiB

euklid

#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("-O3")
//#pragma GCC optimize("Ofast")

#define N 200005
#define NN 1005000
#define PB push_back
#define M ll(1e9 + 7)
#define all(x) x.begin(), x.end()
#define sz(x) int(x.size())
#define pri(x) cout << x << endl
//#define endl '\n'
#define _ << " " <<
#define F first
#define S second

using namespace std;
//using namespace __gnu_pbds;

//typedef tree <int, null_type, less <int>, rb_tree_tag, tree_order_statistics_node_update> oredered_set;

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef short int si;

int brd(int a, int b)
{
    if (b > a)
        swap(a, b);

    if (b == 1)
        return a;

    return brd(a / b, b);
}


int gc(int a, int b)
{
    if (b == 0)
        return a;

    return brd(b, a % b);
}

//pair <int, int> pt[N];

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

    //freopen("1.in", "r", stdin);

//    for (int i = 2; i <= 1000; i++)
//        for (int j = 2; j <= 1000; j++)
//        {
//            int t = __gcd(i, j);
//
//            if (pt[t].F != 0) continue;
//
//            int b = brd(i, j);
//
//            b *= b;
//
//            if (t == b)
//                pt[t] = {i, j};
//        }
//
//    for (int i = 0; i < N; i++)
//        if (pt[i].F != 0)
//    {
//        pri(i _ pt[i].F _ pt[i].S);
//    }

    int q;

    cin >> q;

    for (; q > 0; q--)
    {
        ll gc, bd;

        cin >> gc >> bd;

        if (gc == bd)
        {
            pri(gc _ bd);

            continue;
        }

        if (gc == bd && bd == 1)
        {
            pri(3 _ 2);

            continue;
        }

        pri(gc _ sqrt(gc) * gc);
    }
}

• Subtask 1: 4 / 4
• Subtask 2: 0 / 8
• Subtask 3: 0 / 8
• Subtask 4: 0 / 15
• Subtask 5: 0 / 40
• Subtask 6: 0 / 35