该博客讨论了PAT编程挑战中的一个问题，即检查一个正整数在加倍后是否仅由其原始数字的排列组成。通过提供输入规格、输出规格和示例，博客解释了如何使用字符数组处理大数乘法以避免越界，并指出只乘2的运算简化了进位处理。作者提到，虽然提交的非字符数组解决方案通过了两个测试用例，但为了解决所有情况，建议使用字符数组进行大数运算。
7-49 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!
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.
Input Specification:
Each input contains one test case. Each case contains one positive integer with no more than 20 digits.
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 dig
最低0.47元/天 解锁文章
扫一扫
543
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
