1352A - Sum of Round Numbers

Sum of Round Numbers

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: 40004000, 11, 99, 800800, 9090. The following numbers are not round: 110110, 707707, 222222, 10011001.

You are given a positive integer n ( 1≤n≤10⁴). 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 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≤10⁴) — 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≤10⁴ ).

Output

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.

input

5
5009
7
9876
10000
10

output

2
5000 9
1
7 
4
800 70 6 9000 
1
10000 
1
10 

Notes

题意就是按权分解，给你一个数，需要你把这个数各个位上的数按权拿出来，比如1234 分解出1000+200+30+4。对于零的时候需要特殊处理一下， 比如1203分分解出1000+200+3。总的来说就是该位上的数字乘以该位的权重。

AC Code

#include<iostream>
using namespace std;
int w[]={1,10,100,1000,10000};
void Round(int n){
	int num=n, k=0, i=0;
	while(num){
		if(num%10) k++;
		num/=10;
	}
	printf("%d\n", k);
	while(n){
		if(n%10){
			printf("%d ", (n%10)*w[i]);
		}
		n/=10;
		i++;
	}
	printf("\n");
}

int main(){
	int t,n;
	scanf("%d", &t);
	while(t--){
		scanf("%d", &n);
		Round(n);
	}
	return 0;
}