PAT A1023. Have Fun with Numbers

1023. Have Fun with Numbers (20)

时间限制

400 ms

内存限制

65536 kB

代码长度限制

16000 B

判题程序

Standard

作者

CHEN, Yue

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


int main() {
	char str1[30] = {
		'0'
	};
	char str2[30] = {
		'0'
	};
	int count1[10] = {
		0
	};
	int count2[10] = {
		0
	};
	int length, i, t, carry, flag;
	scanf("%s", str1);
	length = strlen(str1);
	for(i = length - 1, carry = 0; i >= 0; i --) {
		
		t = 2 * (str1[i] - '0');
		if(t > 9) {
			str2[i] = t - 10 + '0' + carry;
			carry = 1;
		} else {
			str2[i] = t + '0' + carry;
			carry = 0;
		}
		count1[str1[i] - '0'] ++;
		count2[str2[i] - '0'] ++;
	}
	if(carry == 1) {
		printf("No\n1");
		
	} else {
		for(i = 0, flag = 1; i < 10; i ++) {
			if(count1[i] != count2[i]) {
				flag = 0;
				break;
			}
		}
		if(flag == 1) {
			printf("Yes\n");
		} else {
			printf("No\n");
		}
	}
	for(i = 0; i < length; i ++) {
			printf("%c", str2[i]);
	}
	return 0;
}