351 人解决，395 人已尝试。
413 份提交通过，共有 829 份提交。
1.5 EMB 奖励。
单点时限: 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