CF1352A.Sum of Round Numbers
入门
通过率:0%
时间限制:1.00s
内存限制:256MB
AC君温馨提醒
该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。
题目描述
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.
一个正整数(严格大于零)被称为“整十数”(round),如果它具有形式 d00…0。换言之,一个正整数是整十数,当且仅当它的所有数字中,除最左边(即最高位)的数字外,其余数字均为零。特别地,所有从 1 到 9(含)的数字都是整十数。
例如,以下数字是整十数:4000、1、9、800、90;以下数字不是整十数:110、707、222、1001。
给定一个正整数 n(1≤n≤104)。请将 n 表示为若干个整十数之和,且所用加数(summands)的个数最少。换言之,你需要将给定的数 n 表示为尽可能少的项之和,其中每一项均为整十数。
输入格式
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).
第一行包含一个整数 t(1≤t≤104)—— 表示输入中测试用例的数量。随后是 t 个测试用例。
每个测试用例为一行,包含一个整数 n(1≤n≤104)。
输出格式
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.
输出 t 个测试用例的答案。每个答案必须以一个整数 k 开头——即最少的加数个数。接下来依次输出 k 个“整数”,每个均为“整数”,且它们的和为 n。“整数”可以按任意顺序输出。若存在多个合法答案,输出任意一个即可。
输入输出样例
输入#1
5 5009 7 9876 10000 10
输出#1
2 5000 9 1 7 4 800 70 6 9000 1 10000 1 10
输入解题思路,AI测评打分。不知道怎么写?