CF1553A.Digits Sum

普及/提高-

通过率：0%

AC君温馨提醒

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

题目描述

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 \le x \le n$ and $x$ is interesting.

输入格式

The first line contains one integer $t$ ( $1 \le t \le 1000$ ) — number of test cases.

Then $t$ lines follow, the $i$ -th line contains one integer $n$ ( $1 \le n \le 10^9$ ) for the $i$ -th test case.

输出格式

Print $t$ integers, the $i$ -th should be the answer for the $i$ -th test case.

输入输出样例

输入#1
```
5
1
9
10
34
880055535
```
输出#1
```
0
1
1
3
88005553
```

说明/提示

The first interesting number is equal to $9$ .

首页