HourRank Problem B

Revision en1, by thedark, 2017-06-03 10:46:51

Could someone explain in detail how to solve this problem. THe editorialist talks about matrix exponentiation. I know how to apply this when we solve linear equation, like F(N) for fibonacci series. But here we want to apply it on dp[i][j] where dp[i][j] = number of lists whose sum is i and last number is j. How we solve it.

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English thedark 2017-06-03 10:47:27 2 Tiny change: 'problem. THe editoria' -> 'problem. The editoria'
en1 English thedark 2017-06-03 10:46:51 420 Initial revision (published)