Want to solve this problem? Login now to get access to solve the problems

Problem

Submissions

Solution

Leaderboard

Coming soon

3

Difficulty: MEDIUM

Avg. time to solve

35 min

Success Rate

45%

Problem Statement

Suggest Edit

```
1. He always presses the button which has a digit written on it, i.e., he never presses the ‘*’ and ‘#’ button.
2. Once he presses a button, the next button he presses should either be the same button or the button which is adjacent to the previous button.
3. In starting he can press any button except ‘*’ and ‘#’.
```

```
The first line of input contains a single integer T, representing the number of test cases or queries to be run.
Then the T test cases follow.
The first and only line of each test case contains a positive integer N, which represents the number of buttons to press.
```

```
For each test case, print the number of numbers that can be generated after pressing exactly the N buttons on the keypad.
```

```
You do not need to print anything, it has already been taken care of. Just implement the given function.
```

```
1 <= T <= 10
1 <= N <= 5 * 10^4
Where T is the number of test cases, N is the number of buttons to press.
```

```
2
1
5
```

```
10
2062
```

```
In the 1st test case, Mike can generate the following numbers {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}.
In the 2nd test case, some of the numbers that Mike can generate are {12365, 11111, 74747, 08521,....}.
```

```
2
2
3
```

```
36
138
```

Want to solve this problem? Login now to get access to solve the problems