{"trustable":false,"sections":[{"title":"","value":{"format":"HTML","content":"\u003cp\u003e\r\n\tWrite a program which computes the greatest common divisor (\u003cspan data-scayt_word\u003d\"GCD\" data-scaytid\u003d\"1\"\u003eGCD\u003c/span\u003e) and the least common multiple (LCM) of given \u003ci\u003ea\u003c/i\u003e and \u003ci\u003eb\u003c/i\u003e (0 \u0026lt; \u003ci\u003ea, b\u003c/i\u003e \u0026le; 2,000,000,000). You can \u003cspan data-scayt_word\u003d\"supporse\" data-scaytid\u003d\"2\"\u003esupporse\u003c/span\u003e that LCM(a, b) \u0026le; 2,000,000,000.\u003c/p\u003e\r\n\u003ch2\u003e\r\n\tInput\u003c/h2\u003e\r\n\u003cp\u003e\r\n\tInput consists of several data sets. Each data set contains \u003ci\u003ea\u003c/i\u003e and \u003ci\u003eb\u003c/i\u003e separated by a single space in a line. The input terminates with \u003cspan data-scayt_word\u003d\"EOF\" data-scaytid\u003d\"5\"\u003eEOF\u003c/span\u003e.\u003c/p\u003e\r\n\u003ch2\u003e\r\n\tOutput\u003c/h2\u003e\r\n\u003cp\u003e\r\n\tFor each data set, print \u003cspan data-scayt_word\u003d\"GCD\" data-scaytid\u003d\"3\"\u003eGCD\u003c/span\u003e and LCM separated by a single space in a line.\u003c/p\u003e\r\n\u003ch2\u003e\r\n\tSample Input\u003c/h2\u003e\r\n\u003cpre\u003e\r\n8 6\r\n50000000 30000000\r\n\u003c/pre\u003e\r\n\u003ch2\u003e\r\n\tOutput for the Sample Input\u003c/h2\u003e\r\n\u003cpre\u003e\r\n2 24\r\n10000000 150000000\r\n\u003c/pre\u003e"}}]}