Cod sursa(job #126108)

Utilizator gigi_becaliGigi Becali gigi_becali Data 21 ianuarie 2008 14:00:40
Problema Cutii Scor 0
Compilator cpp Status done
Runda Arhiva de probleme Marime 0.88 kb
#include <cstdio>
#include <string>

short dp1[3][1001], dp2[3][1001];

inline void add(short a[], short b[])
{
	int i, t=0;
	for(i=1; i<=a[0] || i<=b[0] || t; ++i, t/=10)
		a[i]=(t+=a[i]+b[i])%10;
	a[0]=i-1;
}

inline void afis(short a[])
{
	for(int i=a[0]; i ; --i)printf("%d", a[i]);
	printf("\n");
}

int main()
{
//freopen("vecini.in","r",stdin);
	int n;
	//scanf("%d", &n);
n=2000;	
	if(n==0){ printf("0\n");return 0;}
	if(n==1){ printf("1\n"); return 0;}
	
	dp1[0][0]=1;
	dp1[0][1]=2;
	dp1[1][0]=1;
	dp1[1][1]=3;
	dp1[2][0]=1;
	dp1[2][1]=2;
	
	int i, j;
	
	for(i=3;i<=n;++i)
	{
		for(j=0;j<3;++j)
		{
			if(j-1>=0) add(dp2[j], dp1[j-1]);
			add(dp2[j], dp1[j]);
			if(j+1<=2) add(dp2[j], dp1[j+1]);
		}
		memcpy(dp1, dp2, sizeof(dp1));
		memset(dp2, 0, sizeof(dp2));
	}
		
	add(dp1[0], dp1[1]);
	add(dp1[0], dp1[2]);
	afis(dp1[0]);
	return 0;
}