pepcoding.com 21/10/2021 printStairPaths

code.cpp

#include <iostream>
using namespace std;

void printStairPaths(int n, string psf){
    if(n == 0) {  //base case
        cout << psf << endl;  //print output string psf(path so far)
        return;
    }
    
    for(int jumps = 1; jumps <= 3; jumps++) {  // loop for making all possible jumps
        if(n - jumps >= 0)
        printStairPaths(n - jumps, psf + to_string(jumps));  // function call
    }
}

int main(){

    int n;
    cin >> n;
    printStairPaths(n, ""); // function call
}

code.py

def printStairPaths(ques, asf):
    if ques == 0:  # base case
        print(asf)
        return;
    
    for i in range(1,4): # possible moves are 1, 2 and 3
        if ques - i >= 0:
            printStairPaths(ques - i, asf + str(i))  # recursive call
    

ques = int(input())
printStairPaths(ques, "");

snippet.cpp

#include <iostream>
using namespace std;

void printStairPaths(int n, string psf){
    // write your code here
  
}

int main(){

    int n;
    cin >> n;
    printStairPaths(n, ""); // function call
}

snippet.py

def printStairPaths(ques, asf):
    # write your code here
    

ques = int(input())
printStairPaths(ques, "");