At the mathematical competition, the guys played the fascinating ancient Chinese puzzle Tangram. In one game set there were A acute-angled triangles, and in the other - B obtuse-angled triangles. What is the smallest number of participants who can use sets of the same number of each type of triangles?
Write the solution to the problem as a function solve(A, B) that returns the answer. You don't need to enter or withdraw anything!
Examples
| # |
Input |
Output |
| 1 |
12 15 |
60 |
Запрещенные операторы:lcm;gcd