11388 - GCD LCM

Author: Ismail Hosen

Daffodil International University

Problem Link

//Please follow from main function

#include<stdio.h>

long int gcd(long int x, long int y)

{

    long int gd;

    while(y!=0)

    {

        gd=x%y;

        x=y;

        y=gd;

    }

    return x;

}

int main()

{

    long int m, n, gc, lcm, t;

    scanf("%ld", &t);

    while(t--){

        scanf("%ld %ld", &n, &m);

        lcm=n*m;

        gc=gcd(n, m);

        if(gc<n)

            printf("-1\n");

        else

            printf("%ld %ld\n", n, lcm/n);

    }

    return 0;

}