I have a dynamic programming problem but I can't think of a way to do it

Правка en1, от MonsieurV, 2019-09-04 18:02:45

There are M gifts and N students. Count the dividing numbers so that the number of gifts from the following student is not greater than the amount of the previous student's gift

input 3 2 output 2

explain : There are 2 ways to choose : (3;0) and (2;1)

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский MonsieurV 2019-09-04 18:02:45 331 Initial revision (published)