Anonymous user
Talk:Stair-climbing puzzle: Difference between revisions
→Problem statement: okok read better the task, it falls one step when unsuccessfull so it needs to climb 2, 3...:)
(→Problem statement: ? recursion unnecessary and wrong? ?) |
(→Problem statement: okok read better the task, it falls one step when unsuccessfull so it needs to climb 2, 3...:)) |
||
Line 2:
The problem is ambiguous as stated. It says to climb one step up, not climb up one step up from the starting position. Thus the original C# code that was there solved the 'climb one step up'. <span style="font-size: smaller;" class="autosigned">—Preceding unsigned comment added by [[Special:Contributions/71.59.209.100|71.59.209.100]]</span>
:Okay, I've made it more explicit. —[[User:Underscore|Underscore]] 00:30, 7 November 2009 (UTC)
|