#¯. 最小公倍数

    Type: Default 1000ms 256MiB

最小公倍数

You cannot submit for this problem because the contest is ended. You can click "Open in Problem Set" to view this problem in normal mode.

Background

Description

给定两个正整数,计算这两个数的最小公倍数。

Format

Input

输入包含多组测试数据,每组只有一行,包括两个不大于1000的正整数.</p>

Output

对于每个测试用例,给出这两个数的最小公倍数,每个实例输出一行。

Samples

10 14
70

Limitation

1s, 1024KiB for each test case.

第七届SWPU-ACM老生预选赛

Not Attended
Status
Done
Rule
ACM/ICPC
Problem
187
Start at
2022-9-19 14:00
End at
2022-10-28 14:00
Duration
936 hour(s)
Host
Partic.
45