poj 3982 序列

题目

大数运算。Java秒过

import java.math.BigInteger;
import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner in = new  Scanner(System.in);
		BigInteger a,b,c;
		while(in.hasNext())
		{
			a=in.nextBigInteger();
			b = in.nextBigInteger();
			c = in.nextBigInteger();
			for(int i=1;i<=32;i++)
			{
				a=a.add(b).add(c);
				b=a.add(b).add(c);
				c=a.add(b).add(c);
			}
			System.out.println(a.add(b).add(c));
			//因为数据是从A0开始的
		}
		
	}
}

但是用C++ 就老是WA，各种测试案例都试过了。先放到这，以后再看。。。

#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
const int Max = 1e3;
char a[Max],b[Max],c[Max];
int x[Max+10],y[Max+10],k[Max+10],z[Max*3+10];

void solve(char aa[],char bb[],char cc[])
{
    int len1,len2,len3,i,j,p;
    len1 = strlen(aa);
    len2 = strlen(bb);
    len3 = strlen(cc);
    for(j=0,i=len1-1;i>=0;i--)
        x[j++]=aa[i]-'0';
    for(j=0,i=len2-1;i>=0;i--)
        y[j++]=bb[i]-'0';
    for(j=0,i=len3-1;i>=0;i--)
        k[j++]=cc[i]-'0';

  int  Ma = max(len1,max(len2,len3));
    for(i=0;i<Ma;i++)
        z[i]=x[i]+y[i]+k[i];

    for(i=0;i<Max;i++)
        if(z[i]>=10)
        {
            z[i+1]=z[i+1]+z[i]/10;
            z[i]=z[i]%10;
        }

    for(i=Max;i>0;i--)
    {
        if(z[i]==0) continue;
        else break;
    }


    for(j=0;i>=0;i--)
       c[j++]=z[i]+'0';
    c[j]='';
}
int main()
{
   int i;
   char tmp[Max];
  // freopen("input.txt","r",stdin);
    while(~scanf("%s %s %s",a,b,c))
    {
        if(a[0]=='0'&&b[0]=='0'&&c[0]=='0')
        {
             printf("0
");
             continue;
        }
        for( i=3;i<=99;i++)
        {
            strcpy(tmp,c);
            solve(a,b,c);
            strcpy(a,b);
            strcpy(b,tmp);
        }
        for( i=Max;i>=0;i--)
        {
            if(z[i]==0) continue;
            else break;
        }

         for(;i>=0;i--)
            printf("%d",z[i]);
        printf("
");
        a[0]='';c[0]='';b[0]='';
        memset(x,0,sizeof(x));
        memset(y,0,sizeof(y));
        memset(z,0,sizeof(z));
    }
    return 0;
}