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 11 to 99 (inclusive) are round.

For example, the following numbers are round: 40004000 , 11 , 99 , 800800 , 9090 . The following numbers are not round: 110110 , 707707 , 222222 , 10011001 .

You are given a positive integer nn ( 1n1041 \le n \le 10^4 ). Represent the number nn as a sum of round numbers using the minimum number of summands (addends). In other words, you need to represent the given number nn as a sum of the least number of terms, each of which is a round number.

输入格式

The first line contains an integer tt ( 1t1041 \le t \le 10^4 ) — the number of test cases in the input. Then tt test cases follow.

Each test case is a line containing an integer nn ( 1n1041 \le n \le 10^4 ).

输出格式

Print tt answers to the test cases. Each answer must begin with an integer kk — the minimum number of summands. Next, kk terms must follow, each of which is a round number, and their sum is nn . 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
首页