needed help in problem candies from atcoder educational dp contest

Revision en1, by hars123, 2019-01-17 14:02:19

I am finding it difficult to find the relation for transition from one state to another. i.e. if dp[i][j] represents no of ways of distributing j candies among positions [1,i]. Can someone explain what should i think to find that transition. Or i am just unable to observe the pattern.

Tags #dynamic-programming

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English hars123 2019-01-17 14:02:19 351 Initial revision (published)