Recursion: Davis' Staircase


Problem Statement :


Davis has a number of staircases in his house and he likes to climb each staircase 1, 2, or 3  steps at a time. Being a very precocious child, he wonders how many ways there are to reach the top of the staircase.

Given the respective heights for each of the  staircases in his house, find and print the number of ways he can climb each staircase, module 10^10 + 7  on a new line.


Example

n  =  5


The staircase has 5 steps. Davis can step on the following sequences of steps:

1 1 1 1 1
1 1 1 2
1 1 2 1 
1 2 1 1
2 1 1 1
1 2 2
2 2 1
2 1 2
1 1 3
1 3 1
3 1 1
2 3
3 2



Function Description

Complete the stepPerms function using recursion in the editor below.

stepPerms has the following parameter(s):

int n: the number of stairs in the staircase
Returns

int: the number of ways Davis can climb the staircase, modulo 10000000007
Input Format

The first line contains a single integer, s, the number of staircases in his house.
Each of the following s lines contains a single integer, n, the height of staircase i.


Constraints

1  <=  s   <=  5
1  <=  n   <= 36


Solution :



title-img 




                        Solution in C++ :

In   C++  :







#include <bits/stdc++.h>
#define MOD 10000000007
using namespace std;
int dp[100001], n;

int count_paths(int i) {

	if(i == 0)
		return 1;
	if(i < 0)
		return 0;
	if(dp[i] != -1)
        return dp[i];
	dp[i] = count_paths(i - 1) % MOD;
	dp[i] = (dp[i] + count_paths(i - 2)) % MOD;
	dp[i] = (dp[i] + count_paths(i - 3)) % MOD;
	return dp[i];
}

int main() {

	int t;
	cin >> t;
	assert(t >=1 and t<= 5);
	for(int i = 0; i < t; i++) {
		cin >> n;
		assert(n >= 1 and n <= 100000);
		memset(dp, -1, sizeof dp);
		int ans = count_paths(n);
		cout << ans << endl;
	}

	return 0;
}
                    


                        Solution in Java :

In    Java  :








import java.util.*;

class Solution {
    final static long _MOD = 1000000007;
    
    public static long countPathsMemoized(int numberOfSteps) {
        long[] memo = new long[numberOfSteps + 1];
        long numberOfWays = 1;
        for(int i = 1; i < numberOfSteps; i++) {
            numberOfWays += countPathsMemoized(i, memo);
        }
        return numberOfWays % _MOD;
    }
    
    public static long countPathsMemoized(int numberOfSteps, long[] memo) {
        if(numberOfSteps < 3) {
            return (numberOfSteps > 0) ? numberOfSteps : 0;
        }
        if(memo[numberOfSteps] == 0) {
            memo[numberOfSteps] = (
                                  countPathsMemoized(numberOfSteps - 1, memo)
                                + countPathsMemoized(numberOfSteps - 2, memo)
                                + countPathsMemoized(numberOfSteps - 3, memo)
                                ) % _MOD;
                                
        }
        return memo[numberOfSteps];
    }  
    
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int numberOfStaircases = scanner.nextInt();
        while(numberOfStaircases-- > 0) {
            int numberOfSteps = scanner.nextInt();
            System.out.println(countPathsMemoized(numberOfSteps));
        }
        
        scanner.close();
    }
}
                    


                        Solution in Python : 
                            
In   Python3  :




def stepPerms(n):
    f1, f2, f3 = 1, 2, 4
    for i in range(n-1):
        f1, f2, f3 = f2, f3, f1 + f2 + f3
    return f1


View More Similar Problems

Poisonous Plants

There are a number of plants in a garden. Each of the plants has been treated with some amount of pesticide. After each day, if any plant has more pesticide than the plant on its left, being weaker than the left one, it dies. You are given the initial values of the pesticide in each of the plants. Determine the number of days after which no plant dies, i.e. the time after which there is no plan

View Solution →

AND xor OR

Given an array of distinct elements. Let and be the smallest and the next smallest element in the interval where . . where , are the bitwise operators , and respectively. Your task is to find the maximum possible value of . Input Format First line contains integer N. Second line contains N integers, representing elements of the array A[] . Output Format Print the value

View Solution →

Waiter

You are a waiter at a party. There is a pile of numbered plates. Create an empty answers array. At each iteration, i, remove each plate from the top of the stack in order. Determine if the number on the plate is evenly divisible ith the prime number. If it is, stack it in pile Bi. Otherwise, stack it in stack Ai. Store the values Bi in from top to bottom in answers. In the next iteration, do the

View Solution →

Queue using Two Stacks

A queue is an abstract data type that maintains the order in which elements were added to it, allowing the oldest elements to be removed from the front and new elements to be added to the rear. This is called a First-In-First-Out (FIFO) data structure because the first element added to the queue (i.e., the one that has been waiting the longest) is always the first one to be removed. A basic que

View Solution →

Castle on the Grid

You are given a square grid with some cells open (.) and some blocked (X). Your playing piece can move along any row or column until it reaches the edge of the grid or a blocked cell. Given a grid, a start and a goal, determine the minmum number of moves to get to the goal. Function Description Complete the minimumMoves function in the editor. minimumMoves has the following parameter(s):

View Solution →

Down to Zero II

You are given Q queries. Each query consists of a single number N. You can perform any of the 2 operations N on in each move: 1: If we take 2 integers a and b where , N = a * b , then we can change N = max( a, b ) 2: Decrease the value of N by 1. Determine the minimum number of moves required to reduce the value of N to 0. Input Format The first line contains the integer Q.

View Solution →