Count the Number of Ones Problem Statement

Given an integer N, calculate the total number of times the digit '1' appears in each number from 0 to N inclusive.

Input:

T (number of test cases)
Each test case contains an integer N

Output:

For each test case, return the total count of digit '1' from 0 to N.

Example:

Input:

2
5
13

Output:

1
6

Explanation:

For N = 5, the numbers are 0, 1, 2, 3, 4, 5 and there is 1 occurrence of '1'.
For N = 13, the numbers are 0 to 13, and there are 6 occurrences of '1'.

Constraints:

• 1 ≤ T ≤ 11
• 1 ≤ N ≤ 5000
• Time Limit: 1 sec

Note:

You do not need to print anything; implement the provided function to return the answers.