cpp/F20RecursionAssignment/Staircase.cpp at main · roydevashish/cpp · GitHub

52 lines (39 loc) · 816 Bytes

Title: Staircase

Problem statement

A child is running up a staircase with N steps, and can hop either 1 step, 2 steps or 3 steps at a

time. Implement a method to count how many possible ways the child can run up to the stairs. You

need to return number of possible ways W.

Detailed explanation ( Input/output format, Notes, Images )

Input format :

Integer N

Output Format :

Integer W

Constraints :

1 <= N <= 30

Sample Input 1 :

Sample Output 1 :

Sample Input 2 :

Sample Output 2 :

#include<iostream>

using namespace std;

int Staircase(int n) {

if(n < 0) {

return 0;

}

if(n == 0) {

return 1;

}

return Staircase(n-1) + Staircase(n-2) + Staircase(n-3);

}

int main() {

int n, output;

cin >> n;

output = Staircase(n);

cout<< output <<endl;

}

Expand file tree