Discussion @ 1017. Staircases @ Timus Online Judge

Online Judge	Problems	Authors	Online contests
About Online Judge Frequently asked questions Site news Webboard Links	Problem set Submit solution Judge status Guide	Register Update your info Authors ranklist	Current contest Scheduled contests Past contests Rules

Discussion of Problem 1017. Staircases

Kirino Dp [1] // Problem 1017. Staircases 21 Feb 2016 20:47

dp[i][j] - represents number of staircases with i cubes and with the height of last block j.
Answer is dp[n][1] + dp[n][2] + dp[n][3] ... dp[n][n].

Saurav Kumar Re: Dp // Problem 1017. Staircases 11 Jul 2016 03:57

can u help me with some algorithm better than dp(which works in O(n^2))

Edited by author 11.07.2016 03:57