1136 A Delayed Palindrome (20 分) bign数组开1000是不够的

bign的数组开1000是不够的，因为在边界条件下有可能在叠加的过程中位数会超过1000。在解题过程中数组要稍微开大一点，留一点冗余。

#include<cstdio>
#include<algorithm>
#include<string>
#include<iostream>
using namespace std;
const int maxn = 1010;//这里maxn取值大于1000
struct bign{
	int d[maxn];
	int len;
	bign(){
		fill(d,d+maxn,0);
		len = 0;
	}
};
bign change(string s)
{
	bign a;
	for(int i=s.size()-1; i>=0; i--){
		a.d[a.len++] = s[i]-'0';
	}
	return a;
}
bign Reverse(bign a)
{
	for(int i=0; i<a.len/2; i++){
		swap(a.d[i],a.d[a.len-1-i]);
	}
	return a;
}
bool isPalin(bign a)
{
	for(int i=0; i<a.len/2; i++){
		if(a.d[i]!=a.d[a.len-1-i]) return false;
	}
	return true;
}
bign add(bign a,bign b)
{
	int carry = 0,i;
	bign c;
	for(i=0; i<a.len||i<b.len; i++){
		int now = a.d[i]+b.d[i]+carry;
		c.d[i] = now%10;
		carry = now/10;
	}
	c.len = i;
	if(carry!=0) c.d[c.len++] = carry; 
	return c;
}
void printBign(bign a)
{
	for(int i=a.len-1; i>=0; i--){
		printf("%d",a.d[i]);
	}
}
int main()
{
	string s;
	cin>>s;
	bign a = change(s);
	int k=0;
	while(k<10&&!isPalin(a)){
		k++;
		bign b = Reverse(a);
		bign c = add(a,b);
		printBign(a);
		printf(" + ");
		printBign(b);
		printf(" = ");
		printBign(c);
		printf("\n");
		a = c;
	}
    if(isPalin(a)){
		printBign(a);
		printf(" is a palindromic number.\n");
	}
    else{
        printf("Not found in 10 iterations.");
    }
}