ENG  RUS Timus Online Judge
Online Judge
Задачи
Авторы
Соревнования
О системе
Часто задаваемые вопросы
Новости сайта
Форум
Ссылки
Архив задач
Отправить на проверку
Состояние проверки
Руководство
Регистрация
Исправить данные
Рейтинг авторов
Текущее соревнование
Расписание
Прошедшие соревнования
Правила
вернуться в форум

## Обсуждение задачи 1017. Лестницы

I think it in this way.
Послано CodeChomper 28 май 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 июн 2013 15:53
really smart!
how can you get that dude?
Re: I think it in this way.
Послано Rustambek 31 июл 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 фев 2017 14:12
really nice idea, i like it.
Re: I think it in this way.
Послано egardoz 27 дек 2017 17:51
good job, man
Re: I think it in this way.
Послано jac_nikola 28 окт 2021 03:44
But how does this transition ensures that the next column always has more bricks than the current column?