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 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
完整代码
#include<stdio.h>
int main()
{
int ch1[21], ch2[22] = { 0 };
char temp;
int i = 0, num[10] = { 0 };
while ((temp = getchar()) != '\n')
{
ch1[i] = temp - '0';
i++;
num[(temp - '0')]++;
}
int i2 = 21;
ch2[i2] = (ch1[i-1] * 2) % 10;
i2--;
int j = i - 2;
for (; j >= 0; j--)
{
int buf = ch1[j + 1] * 2 / 10 + ch1[j] * 2 % 10;
ch2[i2] = buf;
i2--;
}
ch2[i2] = ch1[j + 1] * 2 / 10;
if(ch2[i2]!=0)
i2--;
for (int k = 21; k > i2; k--)
{
num[ch2[k]]--;
}
int flag = 0;
for (int i = 0; i < 10; i++)
{
if (num[i] != 0)
{
printf("No\n");
flag = 1;
break;
}
}
if(flag==0)
printf("Yes\n");
int k = 0;
while (ch2[k] == 0)
{
k++;
}
for (; k < 22; k++)
{
printf("%d", ch2[k]);
}
return 0;
}