1023. Have Fun with Numbers (20)-PAT甲级真题（大整数运算）

柳婼

已于 2023-11-09 18:04:18 修改

阅读量2.5k

点赞数 6

文章标签： PAT 算法

于 2016-08-08 21:40:46 首次发布

本文链接：https://blog.csdn.net/liuchuo/article/details/52155928

版权

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 file contains one test case. Each case contains one positive integer with no more than 20 digits.

Output Specification: