Editorial for Gozz's Payment

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.

Authors: Tommoa

Editorialist: Tommoa

In this question, you had to figure out if you could make exactly \($X\) with \(a\) $5 coins and \(b\) $7 coins. Our time limit was well above anything that was required for this question, and so a simple \(O(a*b)\) algorithm that just checks all the different possible combinations of coins to see if they equal \(X\) works just fine.

Once again, everyone that attempted this question got it relatively easily, with our top two teams finishing in around five minutes.


There are no comments at the moment.