Abstract
The article from the series dedicated to problems of Mathematical Olympiad - category P (programming) discusses different solutions of one practical competition problem from the school round of the 2019/20 school year. The task deals with the known problem of paying a given amount using the smallest possible number of banknotes or coins.
The article shows when a simple greedy algorithm can be used in the solution and what can be done if we cannot use this method.