公约数和公倍数

3
6 6
12 11
33 22

6 6
1 132
11 66

 
#include<iostream>
using namespace std;
int gcd(int a,int b)
{

    int min=(a<b)?a:b;
    int max=(a>b)?a:b;
    while(min!=0)
    {
    int k = max%min;
    max=min;
    min=k;
    }
    return max;

}
int main()
{
    int test ;
    int num1,num2;
    cin>>test;
    while(test--)
    {
        cin>>num1>>num2;
        int kk = (num1 * num2)/gcd(num1,num2);

        cout<<gcd(num1,num2)<<" "<<kk<<endl;

    }
    return 0;

}