Sum of Round Numbers /完美的数字 CodeForces 1352A

最新推荐文章于 2021-08-10 09:47:15 发布

没看过这么有个性的昵称啊

最新推荐文章于 2021-08-10 09:47:15 发布

阅读量236

点赞数

分类专栏：日志

本文链接：https://blog.csdn.net/qq_30492585/article/details/106606002

版权

这篇博客介绍了如何将一个正整数表示为最少数量的圆数（即除了最高位外其他位为0的数字）之和。题目要求在给定的正整数n（1≤n≤10^4）范围内找到这样的表示方法，使用最少的加数。文章提供了一个例子并给出了输入输出格式。

摘要由CSDN通过智能技术生成

六一学校搞了个virtual judge的小组测试，都是很简单的题，但是因为懒不学算法所以一脸懵。学校为了不让你搜索题目还把题目翻译了，很机智。当时没做出来，后来找原题看别人解法自己又写了一遍，觉得这个方法比较简单，暴力枚举

英语原文

Sum of Round Numbers CodeForces - 1352A
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

小明认为如果是整数的数字则是完美的数字，比如10，50，100，2000（包括）1~9。否则就是不完美的数字，比如12，99，666…
给你一个数字，你能把它拆分成最完美的数字吗

关注