In a recent contest, I came across a problem in which the basic idea was:
"There are x coins of value a and y coins of value b, they must be distributed among N children in such a way that each child gets amount= number_of_coins_of_type_A*a+ number_of_coins_of_typeB*b , number of coins of each type>=0
Find the maximum amount of money that the child with minimum amount among the N can get? "
Any leads or hints regarding the approach would be very helpful.
Thanks in advance.