Sum of Round Numbers（C++暴力破解）

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

#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<cstdio>
#include<deque>
#include<fstream>
#include<iomanip>
#include<map>
#include<string>
#include<set>
#include<stack>
#include<vector>
using namespace std;
int main()
{
	int t;
	cin >> t;
	while (t--)
	{
		int a, i = 0, h = 0;
		cin >> a;
		int n = 1;
		int b[10];
		while (n <= a)
		{

			if (a % n != 0)
			{
				i++;
				b[h] = a % n;
				a = a - b[h];
				n *= 10;
				h++;
				if (n > a&& a / (n / 10) > 0 && a / (n / 10) < 10)
				{
					i++;
					b[h] = a;
					h++;
				}
			}
			else if (a / n > 0 && a / n < 10 && a % n == 0)
			{
				i++;
				b[h] = a;
				h++;
				n *= 10;
			}
			else
				n *= 10;
		}
		cout << i << endl;
		for (int j = 0; j < h; j++)
		{
			cout << b[j] << " ";
		}
		cout << endl;
	}
}

注意：此题涉及算法本身并不是很难，只是情况较多，做题时缜密思考，逐步debug即可。