/* 👉👉👉CHALLENGE ::: A Man On Stairs of n Steps . 👤✏🔆 A man can jump 1 or 2 steps at a time , find number of ways in which the man can climb n number of steps ? example ::: input :: 3 output :: 3 // because 3 ways 1st way) 3 times 1 step (1,1,1) 2nd way)1 time 2 steps together & then 1 step more(2,1) 3rd way) 1 step & then 1 time 2 steps together(1,2) Remember man can take 1 or 2 steps at a time //level :: easy & interesting //simple approach is welcome , with some explanation HAPPY CODING ☺👍 */ #include #include #include using namespace std; class Path{// CLASS Path: public: Path (int C_remaining, string C_steps="PATH:"): Path_Remaining (C_remaining ),Path_Steps (C_steps ){ } ~Path() {} void newStep (int step){ if (step==1)Path_Steps+="1,"; if (step==2)Path_Steps+="2,"; Path_Remaining -=step; } void displayPath() {cout<< Path_Steps <Path_Remaining<0){// delete path if exceeded delete (pathS.Get(i)); pathS.Remove(i); i--; temp_amount --; continue; } if ((pathS.Get(i))->Path_Remaining==0){// save reached path (pathS.Get(i))->Path_Steps.pop_back(); pathS_Reached.Add(pathS.Get(i)); pathS.Remove(i); i--; temp_amount --; continue; } //increment array and do a step(1-2) each element pathS.Add(new Path((pathS.Get(i))->Path_Remaining, (pathS.Get(i))->Path_Steps )); (pathS.Get(i))->newStep(1); (pathS.GetLast())->newStep(2); } travel++; } while (travel<=totalSteps); //---------------------------------------------------------------OUTPUT cout<<"Total paths finded: "<20){ cout<<" WARNING!!! too many paths!\n"; cout<<"Showing one random path..\n"; (pathS_Reached.Get(rand()%pathS_Reached.Amount()))->displayPath(); } else{ for (i=0 ; idisplayPath(); } } } //»»»»»»»»»»»»»»»»»»»»»»»»» EXECUTE int main() { srand(time(0)); int stepstodo; cin>>stepstodo; FindWays (stepstodo ); return 0; }

CHALLENGE: a man on stairs. link in the comments