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...:)) |
m (moved Talk:Stair Climbing to Talk:Stair-climbing puzzle) |
||
(No difference)
| |||
Latest revision as of 14:59, 6 February 2010
Problem statement
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'. —Preceding unsigned comment added by 71.59.209.100
- Okay, I've made it more explicit. —Underscore 00:30, 7 November 2009 (UTC)