Please enter your email address or userHandle.
Efficiently count how many integers from 1 to N contains 0's as a digit.
First line of the input contains the number of test cases T. Each line of test case contains the integer N.
Number of integers that contain 0 as a digit are printed.
1 <=T<= 100
1 <=N<= 10000
We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?
Login to access your submissions.
Please choose 'ReadOnlyMode' if you needn't to 'Edit' the problem e.g. viewing OJ's solution, TestCase Files (TCFs), TimeLimit etc.