Problem - 1553A - Codeforces

Let's define S(x) 𝑆 ( 𝑥 ) to be the sum of digits of number x 𝑥 written in decimal system. For example, S(5)=5 𝑆 ( 5 ) = 5 , S(10)=1 𝑆 ( 10 ) = 1 , S(322)=7 𝑆 ( 322 ) = 7 . We will call an integer x 𝑥 interesting if S(x+1)<S(x) 𝑆 ( 𝑥 + 1 ) < 𝑆 ( 𝑥 ) . 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 1 ≤ 𝑥 ≤ 𝑛 and x 𝑥 is interesting. The first line contains one integer t 𝑡 ( 1≤t≤1000 1 ≤ 𝑡 ≤ 1000 )  — number of test cases. Then t 𝑡 lines follow, the i 𝑖 -th line contains one integer n 𝑛 ( 1≤n≤ 10 9 1 ≤ 𝑛 ≤ 10 9 ) for the i 𝑖 -th test case. Print t 𝑡 integers, the i 𝑖 -th should be the answer for the i 𝑖 -th test case. The first interesting number is equal to 9 9 .

saved by

• Arush Agrawal