Discussion @ 1017. Staircases @ Timus Online Judge

I think it in this way. CodeChomper 28 May 2011 17:16

Considering that d[i][j] indicate the number of i bricks divided into j columns steps.So if we cut away the downmost brick of every steps, and we can get d[i][j] = d[i-j][j-1](if the 1st step only have one brick) + d[i-j][j](if the 1st step have more than one brick).
Thus q = d[n][2->max_j]

Re: I think it in this way. hliu20 5 Jun 2013 15:53

really smart!
how can you get that dude?

Re: I think it in this way. Rustambek 31 Jul 2015 10:34

Hello,

Thank you for your hint, it was very useful for me

and yes, your solution is awesome!

Re: I think it in this way. chenfy213 16 Feb 2017 14:12

really nice idea, i like it.

Re: I think it in this way. egardoz 27 Dec 2017 17:51

good job, man

Re: I think it in this way. jac_nikola 28 Oct 2021 03:44

But how does this transition ensures that the next column always has more bricks than the current column?

Discussion of Problem 1017. Staircases