1

Number of Ways

Difficulty: MEDIUM
Contributed By
Avg. time to solve
35 min
Success Rate
65%

Problem Statement

Consider a game in which players can choose any of the three coins => 3 or 5 or 10 in a move. There is an infinite supply of all the three types of coins. Given a total amount ‘N’, find the distinct combinations which sums up to 'N'.

Note :
3,5 and 5,3 are not distinct combinations.

Input format:

The first line of input contains an integer ‘T’ denoting the number of test cases.

The first and only line of each test case contains an integer ‘N’ , the total amount. 

Output format:

For each test case, return the number of distinct combinations to reach the total amount is printed.
Note:
You do not need to print anything, it has already been taken care of. Just implement the given function.
Constraints :
1 <= T <= 10
1 <= N <= 5 * 10^4

Time Limit: 1 sec

Sample Input 1:

1
8

Sample Output 1:

1

Explanation of Sample Input 1:

{3,5} and {5,3} are two possible permutations but these represent the same combination. Thus, the output is 1.

Sample Input 2:

2
20
13

Sample Output 2:

4
2

Explanation of sample output 2:

For test case 1 :  N  = 20
Possible distinct combinations are :
3 3 3 3 3 5
5 5 5 5 
5 5 10 
10 10 

For test case 2 : N = 13
Possible distinct combinations are :
3 5 5 
3 10
Reset Code
Full screen
copy-code
Console