Editorial for COCI '10 Contest 7 #1 Šećer

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.

If $N$ $N$ is a multiple of $5$ $5$ , it's obviously best to carry only $5$ $5$ -kilogram packages. If this is not the case, we will have to use at least one $3$ $3$ -kilogram package.

From this we derive the following algorithm: use $3$ $3$ -kilogram packages as long as the remaining number is not a multiple of $5$ $5$ , and then use only $5$ $5$ -kilogram packages to use up the remaining sugar.

There are other approaches to solving this task. We could use two loops to try out all the possible combinations of $3$ $3$ and $5$ $5$ -kilogram packages, and find out which one gives the correct amount of sugar with the least number of packages used.

Comments

There are no comments at the moment.