单点时限: 2.0 sec
内存限制: 256 MB
One night,sunny and solofandy go to bedchamber,they are so funny,they wanted to jump to bedchamber.But there meet a problem,everytime the length of the two boys jumping is different,so I want you to calculate the shortest length they will meet again.
There are several cases,each case there are two numbers a and b,stand for the length of the two boys jumping.
For each case,output a line contain a number of the shortest length they will meet again.
2 3 4 6 5 11
6 12 55
题目 | 计分 |
---|---|
A | 100 |
B | 100 |
C | 100 |
D | 100 |
E | 100 |
F | 100 |
G | 100 |
H | 100 |
I | 100 |
J | 100 |
K | 100 |
L | 100 |
M | 100 |
N | 100 |
O | 100 |
P | 100 |
Q | 100 |
R | 100 |