Algorithm

A. Digits Sum
time limit per test
1 second
memory limit per test
256 megabytes
Problem link- https://codeforces.com/problemset/problem/1553/A
input
standard input
output
standard output

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≤n1≤�≤� and x� is interesting.

Input

The first line contains one integer t� (1≤t≤10001≤�≤1000)  — number of test cases.

Then t� lines follow, the i�-th line contains one integer n� (1≤n≤1091≤�≤109) for the i�-th test case.

Output

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

Example
input
Copy
5
1
9
10
34
880055535
output
Copy
0
1
1
3
88005553
Note

The first interesting number is equal to 99.

 



 

Code Examples

#1 Code Example with C++ Programming

Code - C++ Programming

#include<iostream>
using namespace std;

int main(){
    int t;
    cin>>t;
    int x;
    int n;
    for(int i = 0; i < t; i++){
        cin>>n;
        n += 1;
        x = n / 10;
        cout<<x<<endl;
    }
    return 0;
}
Copy The Code & Try With Live Editor

Input

x
–
+
cmd
5
1
9
10
34
880055535

Output

x
–
+
cmd
0
1
1
3
88005553
Advertisements

Demonstration

Codeforcess Solution 1553-A A. Digits Sum ,C++, Java, Js and Python,1553-A,Codeforcess Solution

Previous
Codeforces solution 1080-B-B. Margarite and the best present codeforces solution
Next
CodeChef solution DETSCORE - Determine the Score CodeChef solution C,C+