Editorial for DMOPC '15 Contest 5 P1 - Gel Bananas
Remember to use this editorial only when stuck, and not to copy-paste code from it. Please be respectful to the problem author and editorialist.
Submitting an official solution before solving the problem yourself is a bannable offence.
Submitting an official solution before solving the problem yourself is a bannable offence.
Okabe and Kurisu will start an experiment together on day if
is divisible by both
and
. In other words, we want to find the number of common multiples of
and
between
and
, inclusive. We can find the lowest common multiple of
and
by using Euclid's GCD function, then divide to get our answer.
Time Complexity:
Comments