A14329 | $Binary Decimal$

时间限制1s

内存限制256MB

通过 / 提交0/0

题目描述

Let's call a number a binary decimal if it's a positive integer and all digits in its decimal notation are either $0$ or $1$ . For example, $1\,010\,111$ is a binary decimal, while $10\,201$ and $787\,788$ are not. Given a number $n$ , you are asked to represent $n$ as a sum of some (not necessarily distinct) binary decimals. Compute the smallest number of binary decimals required for that.

The first line contains a single integer $t$ ( $1 \le t \le 1000$ ), denoting the number of test cases. The only line of each test case contains a single integer $n$ ( $1 \le n \le 10^9$ ), denoting the number to be represented.

For each test case, output the smallest number of binary decimals required to represent $n$ as a sum.

输入 #1

输出 #1

2
5
1

C++ 编辑器

输入

输出