1023 Have Fun with Numbers (20 point(s))
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
题目大意:
一个长度不超过 20 的整数,两倍后的新数是否是原始数的一个排列,输出 Yes 或 No,和两倍后的数
设计思路:
- 利用标记数组记录每个数字出现的次数
编译器:C (gcc)
#include <stdio.h>
#include <string.h>
int main(void)
{
int count[10] = {0};
char num[21] = {0};
int flag, len, temp, i;
scanf("%s", num);
len = strlen(num);
for (flag = 0, i = len - 1; i >= 0; i--) {
temp = (num[i] - '0');
count[temp]++;
temp = temp * 2 + flag;
if (temp >= 10) {
temp = temp - 10;
flag = 1;
} else {
flag = 0;
}
num[i] = (temp + '0');
count[temp]--;
}
int flag2 = 0;
for (i = 0; i < 10; i++)
if (count[i] != 0)
flag2 = 1;
printf("%s", (flag == 1 || flag2 == 1) ? "No\n" : "Yes\n");
if (flag == 1)
printf("1");
printf("%s", num);
return 0;
}