ENG  RUSTimus Online Judge
Online Judge
Online contests
About Online Judge
Frequently asked questions
Site news
Problem set
Submit solution
Judge status
Update your info
Authors ranklist
Current contest
Scheduled contests
Past contests
back to board

Discussion of Problem 1017. Staircases

Posted by Visuian Mihai 6 Oct 2012 16:37
Hello. I have a question, but it is not really about this problem. Generally asking, if you would be grateful to tell me how can I solve this type of dynamic programming problems, could you tell me how can i find the reccurrence easier? Till now I've made backtrackings on small numbers and I tried to search for a reccurrence between the elements, but I find it out pretty hard. Thank you!
Re: Question
Posted by IlushaMax 7 Apr 2016 01:05
So am I.. But sometimes I am trying to calculate how many new figures give us each of them for any N.
I don't know is it correct or is it the easiest way, but it sometimes works)