Module: (C++) Workshop - 1 "Sofia the first". Linear Algorithms

Problem

6
/11

*Jam-jar

Problem

Princess and the rabbit Clever 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 format
Two integers are supplied to the input through a space: n and m (n, m <= 1000)

Output format
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).