| Time Limit | $1$ 秒/Second(s) | Memory Limit | $128$ 兆字节/Megabyte(s) |
| 提交总数 | $33$ | 正确数量 | $17$ | "
| 裁判形式 | 标准裁判/Standard Judge | 我的状态 | 尚未尝试 |
| 难度 | 分类标签 |
Let's define S(x) to be the sum of digits of number x written in decimal system. For example, S(5)=5, S(10)=1, S(322)=7.
We will call an integer x interesting if S(x+1)<S(x). In each test you will be given one integer n. Your task is to calculate the number of integers x such that 1≤x≤n and x is interesting.
The first line contains one integer t (1≤t≤1000) — number of test cases.
Then t lines follow, the i-th line contains one integer n (1≤n≤109) for the i-th test case.
5
1
9
10
34
880055535
0
1
1
3
88005553