uva 11388

 UVA 11388 solution in C++

problem link: Link

#include<bits/stdc++.h>
using namespace std;
int main()
{
    unsigned long long gcd,lcm,y,x,g,m,n,l,t,i;
    cin>>t;
    for(i=0;i<t;i++)
    {
        cin>>g>>l;
        y=max(g,l);
        x=(g+l)-y;
        ///cout<<y<<endl<<x;
        while(y%x!=0)
        {
            m=y;
            n=x;
            x=(m%n);
            y=n;


        }
        gcd=x;
        lcm=(g*l)/gcd;
        if((gcd!=g)&&(lcm!=l))
        {
            cout<<"-1"<<endl;
        }
        else
        {
            cout<<g<<" "<<l<<endl;
        }
    }
return 0;

}