GIURGITEANU, Nicolae - In: Informatica Economica X (2006) 4, pp. 29-33
We will remind briefly the cashier problem. A cashier has leeway a range of different fractional coins and has to pay a certain amount using the most reduced number of coins. If we mark the pay-desk monetary with P {p ,..., pn } 1 = , each pi having as denomination di and with A the final sum,...