Task
Time limit:
1000 ms,
Memory limit:
256 Mb
Princess Sophia and the rabbit Clover are very fond of jam. The princess eats a can of jam in
\(n\)minutes, and the rabbit in
\(m \) minutes. Determine how many minutes they will eat a jar of jam together.
Input :
Two integers are supplied to the input through a space:
\(n\) and
\(m\) (
\(n,m <=1000\))
Output:
You need to output one number - the time in minutes that friends will need to eat one jar of jam together (an incomplete minute is considered 1 minute).
Example
| № |
Входные данные |
Выходные данные |
| 1 |
9 6 |
4 |
It is forbidden to use any algorithmic constructs to solve this problem.
Only arithmetic operators can be used. Prohibited statements:if;for;while;max;import