cf Round #640 (Div. 4) A题

A. Sum of Round Numbers

time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
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.

Input
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).

Output
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.

Example
input
5
5009
7
9876
10000
10
output
2
5000 9
1
7
4
800 70 6 9000
1
10000
1
10
题意：给你一个数，写出他能分解成多少个a * 10^n (n >= 0)的形式，并输出分解后的数
思路：当成字符串处理，最后一位是10^0。判断当前字符, 若字符不为’0’则输出

#include <bits/stdc++.h>
using namespace std;
int main()
{
    int t;
    scanf("%d", &t);
    while(t--){
        int cnt = 0;
        string s;
        cin>>s;
        for(int i = s.size() - 1; i >= 0; i--){
            if(s[i] != '0')
                cnt++;
        }
        cout<<cnt<<endl;
        for(int i = s.size() - 1; i >= 0; i--){
            if(s[i] != '0')
                cout<<(s[i] - '0') * pow(10, s.size() - i - 1)<<" ";
        }
        printf("\n");
    }
    return 0;
}