GCD and LCM

#include <iostream>
#include <vector>
#include <bits/stdc++.h>
using namespace std;
#define int long long

int gcd(int a, int b) {
    int c;
    while (b != 0) {
        c = a % b;
        a = b;
        b = c;
    }
    return a;
}


int lcm(int a, int b, int g) {
    return (a * b) / g;
}



using namespace std;

pair <int, int> subset_mul(const vector<int>& nums, int n, int ss){
    pair<int, int> t;
    t.first = 1;
    t.second = 1;
    if (n == 0){
        return t;
    }
    vector<int> s = {0};
    int d = ss - nums[0];
    int r = nums[0];
    for (int i = 0; i <n; i++) {
        const int v = s.size();
        for (int t = 0; t < v; t++) {
            int k = s[t] * nums[i];
            if (d >= abs(ss - k)) {
                d = abs(ss - k);
                r = k;
            }
            s.push_back(k);
        }
    }
    t.first = r;
    t.second = s[size(s) - 1];
    return t;

}

vector<int> factors(int n) {
    vector<int> f;
    for (int i = 2; i * i <= n; i++) {
        if (n % i == 0) {
            f.push_back(i);
            n /= i;
            while (n % i == 0) {
                f[size(f) - 1] *= i;
                n /= i;
            }
        }
    }
    return f;
}

signed main() {
    int a, b, g, l, h;
    cin >> a >> b;
    g = gcd(a, b);
    l = lcm(a, b, g);
    h = l / g;
    vector<int> f = factors(h);
    pair<int, int> t = subset_mul(f, size(f), sqrt(h));
    int x, y;
    x = g * t.first;
    y = g * (t.second / t.first);
    cout << min(x, y) << " " << max(x, y) << endl;

    return 0;
}

Test 1

Verdict: WRONG ANSWER

Test 2

Verdict: WRONG ANSWER

Test 3

Verdict: ACCEPTED

Test 4

Verdict: WRONG ANSWER

Test 5

Verdict: ACCEPTED

Test 6

Verdict: WRONG ANSWER

Test 7

Verdict: WRONG ANSWER

Test 8

Verdict: WRONG ANSWER

Test 9

Verdict: WRONG ANSWER

Test 10

Verdict: WRONG ANSWER

Test 11

Verdict: WRONG ANSWER

Test 12

Verdict: WRONG ANSWER

Test 13

Verdict: WRONG ANSWER

Test 14

Verdict: WRONG ANSWER

Test 15

Verdict: WRONG ANSWER

Test 16

Verdict: WRONG ANSWER

Test 17

Verdict: WRONG ANSWER

Test 18

Verdict: WRONG ANSWER

Test 19

Verdict: WRONG ANSWER

Test 20

Verdict: WRONG ANSWER

Test 21

Verdict: WRONG ANSWER

Test 22

Verdict: WRONG ANSWER

Test 23

Verdict: WRONG ANSWER

Test 24

Verdict: WRONG ANSWER

Test 25

Verdict: WRONG ANSWER

Test 26

Verdict: WRONG ANSWER

Test 27

Verdict: WRONG ANSWER

Test 28

Verdict: WRONG ANSWER

Test 29

Verdict: WRONG ANSWER

Test 30

Verdict: WRONG ANSWER

Test 31

Verdict: WRONG ANSWER

Test 32

Verdict: WRONG ANSWER

Test 33

Verdict: WRONG ANSWER

Test 34

Verdict: WRONG ANSWER

Test 35

Verdict: WRONG ANSWER

Test 36

Verdict: WRONG ANSWER

Test 37

Verdict: WRONG ANSWER

Test 38

Verdict: WRONG ANSWER

Test 39

Verdict: WRONG ANSWER

Test 40

Verdict: WRONG ANSWER

Test 41

Verdict: WRONG ANSWER

Test 42

Verdict: WRONG ANSWER

Test 43

Verdict: TIME LIMIT EXCEEDED

Test 44

Verdict: TIME LIMIT EXCEEDED

Test 45

Verdict: TIME LIMIT EXCEEDED

Test 46

Verdict: TIME LIMIT EXCEEDED

Test 47

Verdict: WRONG ANSWER

Test 48

Verdict: WRONG ANSWER

Test 49

Verdict: WRONG ANSWER

Test 50

Verdict: WRONG ANSWER

Test 51

Verdict: WRONG ANSWER

Test 52

Verdict: WRONG ANSWER

Test 53

Verdict: WRONG ANSWER

Test 54

Verdict: WRONG ANSWER

Test 55

Verdict: WRONG ANSWER

Test 56

Verdict: WRONG ANSWER

Test 57

Verdict: TIME LIMIT EXCEEDED

Test 58

Verdict: TIME LIMIT EXCEEDED

Test 59

Verdict: TIME LIMIT EXCEEDED

Test 60

Verdict: WRONG ANSWER