A14191 | $Sum of 2050$

时间限制1s

内存限制256MB

通过 / 提交0/0

题目描述

A number is called 2050-number if it is $2050$ , $20500$ , ..., ( $2050 \cdot 10^k$ for integer $k \ge 0$ ). Given a number $n$ , you are asked to represent $n$ as the sum of some (not necessarily distinct) 2050-numbers. Compute the minimum number of 2050-numbers required for that.

The first line contains a single integer $T$ ( $1\le T\leq 1\,000$ ) denoting the number of test cases. The only line of each test case contains a single integer $n$ ( $1\le n\le 10^{18}$ ) denoting the number to be represented.

For each test case, output the minimum number of 2050-numbers in one line. If $n$ cannot be represented as the sum of 2050-numbers, output $-1$ instead.

输入 #1

6
205
2050
4100
20500
22550
25308639900

输出 #1

C++ 编辑器

输入

输出