[Solution] Round Down the Price Codeforces Solution

A. Round Down the Price

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

At the store, the salespeople want to make all prices round.

In this problem, a number that is a power of 10$10$ is called a round number. For example, the numbers 100=1${10}^0=1$, 101=10${10}^1=10$, 102=100${10}^2=100$ are round numbers, but 20$20$, 110$110$ and 256$256$ are not round numbers.

So, if an item is worth m$m$ bourles (the value of the item is not greater than 109${10}^9$), the sellers want to change its value to the nearest round number that is not greater than m$m$. They ask you: by how many bourles should you decrease the value of the item to make it worth exactly 10k${10}^k$ bourles, where the value of k$k$ — is the maximum possible (k$k$ — any non-negative integer).

For example, let the item have a value of 178$178$-bourles. Then the new price of the item will be 100$100$, and the

Solution Click Below:-  👉CLICK HERE👈

👇👇👇👇👇

 answer will be 178−100=78$178-100=78$.

Input

The first line of input data contains a single integer t$t$ (1≤t≤104$1\le t\le {10}^4$) — the number of test cases.

Round Down the Price Codeforces Solution

Polycarp Writes a String from Memory Codeforces Solution

Train and Queries Codeforces Solution

Not a Cheap String Codeforces Solution

Split Into Two Sets Codeforces Solution

Equate Multisets Codeforces Solution

Passable Paths (easy version) Codeforces Solution

Passable Paths (hard version) Codeforces Solution

Each test case is a string containing a single integer m$m$ (1≤m≤109$1\le m\le {10}^9$) — the price of the item.

Output

For each test case, output on a separate line a single integer d$d$ (0≤d<m$0\le d<m$) such that if you reduce the cost of the item by d$d$ bourles, the cost of the item will be the maximal possible round number. More formally: m−d=10k$m-d={10}^k$, where k$k$ — the maximum possible non-negative integer.