2571. GCD and LCM

单点时限: 2.0 sec

内存限制: 256 MB

Write a program which computes the greatest common divisor (GCD) and the least common multiple (LCM) of given $a$ and $b$ $(0 < a, b \leq 44000)$.

输入格式

The first line of input gives the number of cases, $N$ $(1 \leq N \leq 100)$. $N$ test cases follow.

Each test case contains two interger a and b separated by a single space in a line.

输出格式

For each test case, print GCD and LCM separated by a single space in a line.

样例

Input
2
8 6
5000 3000
Output
2 24
1000 15000

1615 人解决,1861 人已尝试。

2030 份提交通过,共有 4092 份提交。

0.7 EMB 奖励。

创建: 11 年,6 月前.

修改: 3 年前.

最后提交: 4 天,15 小时前.

来源: 2009 华东师范大学 研究生复试

题目标签