Posts by kes166

I didn't look yo tour prog you're right answer is fibonacci sequences but it's too long let me show you easier solution:

#include<iostream>
using namespace std;

int main()
{
int n; //the ladder
int currentNum=1;
int previousNum=0;
cout<<"enter the ladders:";
cin>>n;
cout<<endl<<previousNum<<" ";

for(int i=1;i<n;i++)
{
cout<<currentNum<<" ";
currentNum+=previousNum;
previousNum=currentNum-previousNum;
}
system("pause");
return 0;

}

you won't add step in input you just going to find the number of possible combinations.
That's all thanks!!!
Think simpler.
Your computer is too heavy tou are confused.
BE SIMPLER.:)))

I don't think the output of the program is going to be what you think it will be. If you are going to turn that in as a homework assingment, you are better off copy and pasting rdpm. A 4 step ladder will output:

enter the ladders: 4

0 1 1 2

According to the Op, outputting the fibonacci numbers is not the solution.