A14191. Sum of 2050
编程题
普及/提高-
知识点
题目描述
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.
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.
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.
If $n$ cannot be represented as the sum of 2050-numbers, output $-1$ instead.
输入输出样例
输入 #1
6 205 2050 4100 20500 22550 25308639900
输出 #1
-1 1 2 1 2 36
说明/提示
In the third case, $4100 = 2050 + 2050$ .
In the fifth case, $22550 = 20500 + 2050$ .
In the fifth case, $22550 = 20500 + 2050$ .