Atcoder-dp-problem(queens on grid)-explanation

navjotdadwal commented 2 years ago

Queens on grid https://atcoder.jp/contests/abc183/tasks/abc183_e Concepts dp[i][j] = dp[i-1][j] + dp[i-2][j] + dp[i-3][j] + dp[i-4][j]……….. + dp[i-n][j]

dp[i][j-1] + dp[i][j-2] + … + dp[i][j-m]
dp[i-1][j-1] + dp[i-2][j-2] + ….+ dp[i-n][j-m]. Or we can say that dp[i][j] = X[i][j] + Y[i][j] + Z[i][j] X[i][j] = dp[i-1][j] + …… + dp[i-n][j] Y[i][j] = dp[i][j-1] + …… + dp[i][j-m] Z[i][j] = dp[i-1][j-1] + ….. + dp[i-n][j-m] Or we can say that dp[i][j] = X[i][j] + Y[i][j] + Z[i][j] X[i][j] = dp[i-1][j] + X[i-1][j] Y[i][j] = dp[i][j-1] + Y[i][j-1] Z[i][j] = dp[i-1][j-1] + Z[i-1][j-1]

navjotdadwal commented 2 years ago

this i want to add can you assign?

navjotdadwal commented 2 years ago

It is a very good E level problem

navjotdadwal commented 2 years ago

i can also add my cpp code to solve this

saumyasrivastava08 commented 2 years ago

This Question is already assigned to someone . if you want to add more Dp problem do add in DP section and add if the question is not present.

saumyasrivastava08 / Important_Coding_Problems