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:
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.
Sample Input:
1234567899
Sample Output:
Yes
2469135798
题目大意
给出一个长度不超过20的整数a,判断这个数组的两倍b是不是a的一个排列,然后输出这个b。
思路
用char数组分别存储两个数字的各位,b的计算公式为:
t = a i ∗ 2 + c a r r y t = a_{i} * 2 + carry t=ai∗2+carry
b i = t % 10 b_{i} = t \% 10 bi=t%10