Code: atcoder.jp/contests/abc360/su...#atcoder #codechef #codeforces #arc #cp #abc #Atcoder
Your explanations are way better than @aryanc's. Thank you for making such good explanatory videos. Keep it up!
dp[i][1] = ( 1 + (n - 1) * (n - 1) ) * dp[i - 1] [1] can you explain why you are adding + 1 there. that part is already cover na?
No (n-1)(n-1) is for choosing anything other than the current j, and 1 when getting (j,j) Please like, share and subscribe if it's helpful
@@soumyabhattacharjee1051 subscribed sir
Пікірлер: 4
Your explanations are way better than @aryanc's. Thank you for making such good explanatory videos. Keep it up!
dp[i][1] = ( 1 + (n - 1) * (n - 1) ) * dp[i - 1] [1] can you explain why you are adding + 1 there. that part is already cover na?
@soumyabhattacharjee1051
8 күн бұрын
No (n-1)(n-1) is for choosing anything other than the current j, and 1 when getting (j,j) Please like, share and subscribe if it's helpful
@avijitbiswas3544
8 күн бұрын
@@soumyabhattacharjee1051 subscribed sir