GCD and LCM
All submissions for this problem are available.
Two integers A and B are the inputs. Write a program to find GCD and LCM of A and B.
The first line contains an integer T, total number of testcases. Then follow T lines, each line contains an integer A and B.
Display the GCD and LCM of A and B separated by space respectively.
- 1 ≤ T ≤ 1000
- 1 ≤ A,B ≤ 1000000
Input 3 120 140 10213 312 10 30 Output 20 840 1 3186456 10 30
|Time Limit:||1 sec|
|Source Limit:||50000 Bytes|
|Languages:||C, CPP14, JAVA, PYTH, PYTH 3.6, PYPY, CS2, PAS fpc, PAS gpc, RUBY, PHP, GO, NODEJS, HASK, SCALA, D, PERL, FORT, WSPC, ADA, CAML, ICK, BF, ASM, CLPS, PRLG, ICON, SCM qobi, PIKE, ST, NICE, LUA, BASH, NEM, LISP sbcl, LISP clisp, SCM guile, JS, ERL, TCL, PERL6, TEXT, SCM chicken, PYP3, CLOJ, FS|
Fetching successful submissions
If you are still having problems, see a sample solution here.