PTA练习-Have Fun with Numbers

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>
#include<string.h>

int dic[10];

int main(){
	char num[21];
	scanf("%s",&num);
	int len = strlen(num);
	int plus = 0;
	for(int i = len-1; i >= 0; i--){
		int temp = num[i]-'0';
		dic[temp]++;//标记 
		temp = temp * 2 + plus;
		plus = 0; 
		if(temp>9){
			temp-=10;
			plus = 1;
		}
		dic[temp]--;//标记
		num[i] = temp+'0'; 
	}
	int flag = 0;
	for(int i = 0; i < len - 1; i++)
		if(dic[i]!=0){
			printf("No\n");
			flag = 1;
			break;
		}
	if(flag == 0)
	printf("Yes\n");
	if(plus == 1)
	printf("1");
	printf("%s", num);		
	return 0;
}