CF1766A.Extremely Round

普及/提高-

通过率:0%

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

Let's call a positive integer extremely round if it has only one non-zero digit. For example, 50005000 , 44 , 11 , 1010 , 200200 are extremely round integers; 4242 , 1313 , 666666 , 7777 , 101101 are not.

You are given an integer nn . You have to calculate the number of extremely round integers xx such that 1xn1 \le x \le n .

输入格式

The first line contains one integer tt ( 1t1041 \le t \le 10^4 ) — the number of test cases.

Then, tt lines follow. The ii -th of them contains one integer nn ( 1n9999991 \le n \le 999999 ) — the description of the ii -th test case.

输出格式

For each test case, print one integer — the number of extremely round integers xx such that 1xn1 \le x \le n .

输入输出样例

  • 输入#1

    5
    9
    42
    13
    100
    111

    输出#1

    9
    13
    10
    19
    19
首页