Count zero
Submissions: 4747   Accuracy:

24.76%

  Difficulty: Basic   Marks: 1

Given a number d, representing the number of digits of a number. Find the total count of positive integers which have at-least one zero in them and consist d or less digits.

Input:

The first line of input contains an integer T denoting the number of test cases.
The first line of each test case is D,D is number of digits.

Output:

Print the total count of positive integers which have at-least one zero in them.

Constraints:

1 ≤ T ≤ 15
1 ≤ N ≤ 15

Example:

Input:
2
2
3

Output:
9
180

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

Author: rajatjha


If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.



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

to report an issue on this page.