BETA

Difficulty Level: Easy

Submissions: 71 Accuracy:

40.85%

Total number of non-decreasing numbers with n digits
     

A number is non-decreasing if every digit (except the first one) is greater than or equal to previous digit. For example, 223, 4455567, 899, are non-decreasing numbers.

So, given the number of digits n, you are required to find the count of total non-decreasing numbers with n digits.

Input:

The first line of input contains an integer T denoting the number of test cases. Then T test cases follow. The first line of each test case contains the integer n.


Output:

Print the count of total non-decreasing numbers with n digits for each test case in a new line.

Note: Use unsigned long long int.


Constraints:

1<= T <=100

1<= n <=500


Example:

Input:

1

2

3

Output:

10

55

220

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

Contributor: Sujnesh Mishra

Set Default Code

					   
It is recommended to 'Compile & Test' your code before clicking 'Submit'!

Compilation/Execution Result:

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