Pku2680 Computer TransformationAC答案

#include
using namespace std;
#define MaxStep 1000
#define Mod 1000000000
int cc[MaxStep+2][(MaxStep+29)/30];
//Z=X+Y
void Add_HighPrecise(int* x, int y, intz, int len)
{ int i,pass=0;
for(i=0;i<len;++i) {
z[i]=x[i]+y[i]+pass;
if(z[i]>=Mod) {
z[i]=z[i]-Mod;
pass=1;
}else pass=0;
}
}
//Be care of value just like 1001,0123 which should not be output as 1001,123 !!
void Print_HighPrecise(int x, int len)
{ int i,j,temp;
for(i=len-1;i>=0;–i) {
if(x[i]!=0) {
printf("%d",x[i]);
–i;
break;
}
if(i==0) printf(“0”);
}
for(;i>=0;–i) {
temp=Mod/10;
for(j=9;j>0;–j) {
if(x[i]>=temp) break;
printf(“0”);
temp=temp/10;
}
printf("%d",x[i]);
}
printf("\n");
}
int main(int argc, char argv[])
{ int len=(MaxStep+29)/30;
int i,j;
//Make Table!
for(i=0;i<MaxStep+2;++i)
for(j=0;j<len;++j)
cc[i][j]=0;
cc[0][0]=0; cc[1][0]=0; cc[2][0]=1; cc[MaxStep+1][0]=1;
for(i=3;i<=MaxStep;++i) {
Add_HighPrecise(&cc[i-2][0],&cc[MaxStep+1][0],&cc[i][0],len);
Add_HighPrecise(&cc[MaxStep+1][0],&cc[MaxStep+1][0],&cc[MaxStep+1][0],len);
}
//Ordinary Input!
while(scanf("%d",&i)!=EOF) {
Print_HighPrecise(&cc[i][0],len);
}
return 0;
}