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

思路分析：

大整数问题，可以用乘法也可以用加法。

注意：如果乘2后长度不同了就肯定不满足，长度相同再数各自出现的次数。

题解：

#include <cstdio>
#include <cstring>

int count[10] = {0};
char s[21];

struct Bignum{
	int d[1000], len;
	Bignum(){
		memset(d,0,sizeof(d));
		len = 0;
	}
};

Bignum change(char s[]){
	Bignum c;
	c.len = strlen(s);
	for(int i = 0; i < c.len; i++){
		c.d[i] = s[c.len-1-i] - '0';
	}
	return c;
}

Bignum mul(Bignum a, int b){
	Bignum c;
	int temp, carry = 0;
	for(int i = 0; i < a.len; i++){
		temp = a.d[i] * b + carry;
		c.d[c.len++] = temp % 10;
		carry = temp / 10;
	}
	while(carry){
		c.d[c.len++] = carry % 10;
		carry /= 10;
	}
	return c;
}

int main(){
	scanf("%s", s);
	Bignum p = change(s);
	int len = p.len;
	for(int i = 0; i < p.len; i++) count[p.d[i]]++;
	p = mul(p, 2);
	for(int i = 0; i < p.len; i++) count[p.d[i]]--;
	if(p.len != len){
		printf("No\n");
	}else{
		bool judge = true;
		for(int i = 1; i <= 9; i++){
			if(count[i] != 0){
				judge = false; break;
			}
		}
		if(judge) printf("Yes\n");
		else printf("No\n");
	}
	for(int i = p.len-1; i >= 0; i--){
		printf("%d", p.d[i]);
	}
	
	return 0;
}