Write a code in C for: A positive (strictly greater than zero) integer is called nice if

Write a code in C for:

Transcribed Image Text:

A positive (strictly greater than zero) integer is called nice if it is of the form d00.0. In other words, a positive integer is nice if all its digits except the leftmost (most significant) are equal to zero. In particular, all numbers from 1 to 9 (inclusive) are nice. For example, the following numbers are nice: 4000, 1, 9, 800, 90. The following numbers are not nice: 110, 707, 222, 1001. You are given a positive integer n (1sns10^4). Represent the number n as a sum of nice 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 nice number. Input The first line contains an integer t (1<x10^4) – the number of test cases in the input. Then t test cases follow. Each test case is a line containing an integer n (1sns10^4). 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 nice number, and their sum is n. The terms should be printed in ascending order. A positive (strictly greater than zero) integer is called nice if it is of the form d00.0. In other words, a positive integer is nice if all its digits except the leftmost (most significant) are equal to zero. In particular, all numbers from 1 to 9 (inclusive) are nice. For example, the following numbers are nice: 4000, 1, 9, 800, 90. The following numbers are not nice: 110, 707, 222, 1001. You are given a positive integer n (1sns10^4). Represent the number n as a sum of nice 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 nice number. Input The first line contains an integer t (1<x10^4) – the number of test cases in the input. Then t test cases follow. Each test case is a line containing an integer n (1sns10^4). 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 nice number, and their sum is n. The terms should be printed in ascending order.