[algogeeks] Coin denomination

[shady]

Given R and N, output N coins in the range from 1 to R such that average
number of coins needed to represent all the number in the range is
minimized.

Any idea ? hints ?

--