Poj 2506 Tiling

3Y

前导零wa1

a[0]wa1

ac

结构体内重载真忧伤

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
#define N 1010
struct BI{
    int s[N];
    int len;
    BI() {len=1;memset(s,0,sizeof(s));}
    BI operator = (const char *num){
		len=strlen(num);
		for(int i=0;i<len;i++)s[i]=num[len-1-i]-'0';	
		}
	BI operator + (const BI tp){
		BI c;
  		c.len=max(len,tp.len);
		for(int i=0;i<c.len;i++){
		    c.s[i]+=s[i]+tp.s[i];
			while(c.s[i]>=10){	c.s[i+1]+=1;	c.s[i]-=10;	}
	        }
	    if(c.s[c.len])c.len++;
		return c;			
		}
    }a[260];
int main(){
	a[1]="1";a[0]="1";
    int i;
    for(i=2;i<=250;i++)a[i]=a[i-1]+a[i-2]+a[i-2];
    int n;
    while(scanf("%d",&n)!=EOF){
        for(i=a[n].len-1;i>=0;i--)printf("%d",a[n].s[i]);
        printf("\n");
        }
    return 0;
    }