CF1352A.Sum of Round Numbers
普及/提高-
通过率:0%
AC君温馨提醒
该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。
题目描述
A positive (strictly greater than zero) integer is called round if it is of the form d00...0. In other words, a positive integer is round if all its digits except the leftmost (most significant) are equal to zero. In particular, all numbers from 1 to 9 (inclusive) are round.
For example, the following numbers are round: 4000 , 1 , 9 , 800 , 90 . The following numbers are not round: 110 , 707 , 222 , 1001 .
You are given a positive integer n ( 1≤n≤104 ). Represent the number n as a sum of round numbers using the minimum number of summands (addends). In other words, you need to represent the given number n as a sum of the least number of terms, each of which is a round number.
输入格式
The first line contains an integer t ( 1≤t≤104 ) — the number of test cases in the input. Then t test cases follow.
Each test case is a line containing an integer n ( 1≤n≤104 ).
输出格式
Print t answers to the test cases. Each answer must begin with an integer k — the minimum number of summands. Next, k terms must follow, each of which is a round number, and their sum is n . The terms can be printed in any order. If there are several answers, print any of them.
输入输出样例
输入#1
5 5009 7 9876 10000 10
输出#1
2 5000 9 1 7 4 800 70 6 9000 1 10000 1 10