Count number of hops
Submissions: 9827   Accuracy:

54.2%

  Difficulty: Easy   Marks: 2
     

A frog jumps either 1, 2 or 3 steps to go to top. In how many ways can it reach the top

Input:
The first line of input contains an integer T denoting the number of test cases. T testcases follow. Each testcase contains one line of input N denoting the total number of steps.

Output:
For each testcase, in a new line, print the number of ways to reach the top.

Constraints:
1≤ T ≤ 100
1 ≤ N ≤ 50

Example:
Input:

2
1
5

Output:
1
13

** For More Input/Output Examples Use 'Expected Output' option **

Author: rajatjha


Need help with your code? Please use ide.geeksforgeeks.org, generate link and share the link here.

to report an issue on this page.