UVA 11388 - GCD LCM Shipu Ahamed - 01 Sep 2020 Problem PDFSolution:#include int main() { int n,m,t; scanf("%d",&t); while(t--) { scanf("%d%d",&m,&n); if(n%m==0) printf("%d %d\n",m,n); else printf("-1\n"); } return 0; } https://github.com/Shipu/OnlineJudgeProblemSolutionWithCPlusPlus/tree/master/uva/11388/11388.cpp