View Code of Problem 3836

#include<bits/stdc++.h>
using namespace std;

int gcd(int a, int b)
{
    if (b==0)
    {
        return a;
    }
    return gcd(b, a % b);
}
int lcd(int a, int b)
{
    int x = a * b;
    return x / gcd(a, b);
}
int main()
{
    int n, m;
    while (cin >> n >> m)
    {
        int m1 = -1, m2 = -1;
        int min = 0xffffff;
        for (int i = n; i <= m; i+=n)
        {
            for (int j = m; j >= n; j-=n)
            {
                if (gcd(i, j) == n && i*j==m*n)
                {
                    if (min > i + j)
                    {
                        min = i + j;
                        m1 = i;
                        m2 = j;
                    }
                }
            }
        }
        cout << m1 << " " << m2 << endl;
    }
    
}