How to divide 2 types of coins among N children such that the minimum that any child gets is maximized

Правка en1, от mansisinha16, 2020-10-19 15:34:53

Hi,

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.

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский mansisinha16 2020-10-19 15:34:53 607 Initial revision (published)