[CSES][Dynamic Programming] Dice Combinations

cses.fi/proble...
In this problem we see how memoization and dynamic programming can reduce the complexity of some recursive functions from exponential to linear.

[@aankie]

You are the best tutor in the world

[@amirghorban2044]

best channel for practicing cses problem

[@neatlystructured]

Thank you!

[@cppnewbie1949]

agreed

[@ChandraShekhar-by3cd]

Thanks for such a great visualization!

[@neatlystructured]

glad you liked it!

[@adhrit1426]

Explanation was gold! Thank you

[@masaftic]

thank you so much for making these solutions

[@neatlystructured]

you are very welcome!

[@alisalimli]

Thanks !

[@neatlystructured]

you are very welcome!

[@AmanKumar-nj5sz]

I have found your channel very helpful.

[@neatlystructured]

thank you very much!

[@tonymontana-qd1xi]

amazing video

[@neatlystructured]

Thank you so much!

[@bldouyin4145]

Nice thx u:3

[@rudeus132]

Can you explain what you mean by 5 additions?

[@neatlystructured]

In this problem, dp[i] depends on the 6 previous values: dp[i-1], .... , dp[i-6]. and we need 5 additions to sum them up. In general, if you have n values, u need n-1 additions to sum them up.

[@rudeus132]

@@neatlystructured thank you!

[@nurbektaizhanov4534]

Sorry, but i have question. Why you use mod in code? Why we need it? Thanks for tut

[@thuanlevan9568]

because the answer might be too large for long long or int to store

[@belaluddin6554]

For 10, we consider 9,8,7,6,5 and 4.. why don't we consider the rest?

[@caiodavi9829]

because the dice can be 1, 2, 3, 4, 5 or 6. it cant be greater than that

[@HITNUT]

eggrice

[@neatlystructured]

yes please