|
|
вернуться в форумI think it in this way. 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 июн 2013 15:53 really smart! how can you get that dude? Re: I think it in this way. 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. really nice idea, i like it. Re: I think it in this way. good job, man Re: I think it in this way. But how does this transition ensures that the next column always has more bricks than the current column? |
|
|