PAT-1023 Have Fun with Numbers (20 分)

1023 Have Fun with Numbers (20 分)

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

思路

该题先用一个大小为10的数组统计初始输入的那个数中1、2、3、4、5、6、7、8、9、0的个数。

然后模拟乘法，统计1、2、3、4、。。。的个数与第一次统计的进行比较。

 

乘法有进位，如果carry不为0时，这个数的长度就加一了，所以这种情况输出的时候要注意。

 

代码

#include<cstdio>
#include<algorithm>
#include<cstring>

using namespace std;

const int maxn = 20 + 5;
int a[maxn], b[10];
char s[maxn];

void show_verse(int len1) {
	for (int i = len1 - 1; i >= 0; i--) {
		printf("%d", a[i]);
	}
	printf("\n");
}

int main(){
	scanf("%s", s);
	memset(b, 0, sizeof(b));
	int len1 = strlen(s);
	
	for (int i = 0; i < len1; i++) {
		a[len1 - i - 1] = s[i] - '0';
	}
	int tem;
	int add = 0;
	for (int i = 0; i < len1; i++) {
		b[a[i]]++;
		tem = a[i]*2 + add;
		add = tem/10;
		a[i] = tem%10;
	}
	
	if (add != 0) {
		 a[len1] = add;
		 printf("No\n");
		 show_verse(len1+1);
	} else {
		for (int j = 0; j < len1; j++) {
			b[a[j]]--;
		}
		for (int i = 0; i < 10; i++) {
			if (b[i] != 0) {
				printf("No\n");
				show_verse(len1);
				return 0;
			}
		}
		printf("Yes\n");
		show_verse(len1);
	}
	return 0;
}