翻译题10【数据结构基础】

最新推荐文章于 2022-07-16 11:52:48 发布

Abby_yyyyyyy

最新推荐文章于 2022-07-16 11:52:48 发布

阅读量582

点赞数

文章标签： p2p gnu 蓝桥杯

原文链接：https://pintia.cn/problem-sets/1480448337592254464/problems/1480473194037653504

版权

7-4 Have Fun with Numbers (20 分)

【数字游戏】

Notice that the number 123456789 is a 9-digit number consisting exactly the numbers from 1 to 9, with no duplication. Double it we will obtain 246913578, which happens to be another 9-digit number consisting exactly the numbers from 1 to 9, only in a different permutation. Check to see the result if we double it again!

【注意数字123456789是包含9个1至9的数字且无重复，乘2以后我们将获得246913578，并且这个数字也是另9个包含1至9的数字，仅排列方式不同。再次乘2以后试试结果。】

Now you are suppose to check if there are more numbers with this property. That is, double a given number with k digits, you are to tell if the resulting number consists of only a permutation of the digits in the original number.

【现在你将推断检查是否存在更多含这种特征的数字。对一个给定含k个数字的数乘2，你将辨别这个结果数是否只包含原始数字不同排列组合的数。】

Input Specification:

Each input contains one test case. Each case contains one positive integer with no more than 20 digits.

【输入包含一组测试样例，每组样例包含一个正整数且不超过20个数字。】

Output Specification:

For each test case, first print in a line "Yes" if doubling the input number gives a number that consists of only a permutation of the digits in the original number, or "No" if not. Then in the next line, print the doubled number.

【对于每组样例，如果满足以上要求首先第一行输出“Yes”，否则输出“No”，第二行则输出乘2后的数。】