{"trustable":true,"sections":[{"title":"","value":{"format":"HTML","content":"\u003ch1\u003e\u003c/h1\u003e\n\n\u003cp\u003e\nWrite a program which computes the greatest common divisor (GCD) and the least common multiple (LCM) of given \u003cvar\u003ea\u003c/var\u003e and \u003cvar\u003eb\u003c/var\u003e. \n\u003c/p\u003e\n\n\u003ch2\u003eInput\u003c/h2\u003e\n\n\u003cp\u003e\nInput consists of several data sets. Each data set contains \u003cvar\u003ea\u003c/var\u003e and \u003cvar\u003eb\u003c/var\u003e separated by a single space in a line. The input terminates with EOF.\n\u003c/p\u003e\n\n\u003ch2\u003eConstraints\u003c/h2\u003e\n\n\u003cul\u003e\n\u003cli\u003e 0 \u0026lt; \u003cvar\u003ea, b\u003c/var\u003e ≤ 2,000,000,000\u003c/li\u003e\n\u003cli\u003e LCM(\u003cvar\u003ea, b\u003c/var\u003e) ≤ 2,000,000,000\u003c/li\u003e\n\u003cli\u003e The number of data sets ≤ 50\u003c/li\u003e\n\u003c/ul\u003e\n\n\u003ch2\u003eOutput\u003c/h2\u003e\n\n\u003cp\u003e\nFor each data set, print GCD and LCM separated by a single space in a line.\n\u003c/p\u003e\n\n\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e8 6\n50000000 30000000\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e2 24\n10000000 150000000\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n\n\n"}}]}