A. Sum of Round Numbers

题目链接：http://codeforces.com/problemset/problem/1352/A

1352A. Sum of Round Numbers

time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard 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 1to 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

题意：T组数，每组数一个n，输出n各位不为0的总个数，并输出各个的大小。且不要求输出顺序。​ 如：12304 不为0的位数共4个，分别为个位,百位,千位,万位。故第一行输出 4 ，第二行输出 10000 2000 300 4

代码

#include<bits/stdc++.h>
using namespace std;
int main(){
	int n;
	scanf("%d",&n);
	while(n--)
	{
		int num,a[5],sum=0,t=1;
		scanf("%d",&num);
		for(int i=1;i<5;i++)
		{
			a[i]=num%10;//将各位数字存入数组
			num/=10;
			if(a[i] != 0)
				sum ++; //记录非零数出现次数
		}
		printf("%d\n",sum);//输出非零个数
		for(int i=1;i<5;i++)
		{
			if(a[i]!=0)
				printf("%d ",a[i]*t);//输出各部分
			t*=10;
	    }
	   printf("\n");
	}
}