Tiling POJ 2506 "large number"

http://poj.org/problem?id=2506

Description in what many ways can you tile a 2xn rectangle by 2x1 or 2x2 tiles?
Here is a sample tiling of a 2x17 rectangle.

Input input is a sequence of lines, each line containing an integer number 0 <= n <= 250.

Output for each line of input, output one integer number in a separate line giving the number of possible tilings of a 2xn Rectangle.

Sample Input

2
8
200

Sample Output

3
171
2731
845100400152152934331135470251
1071292029505993517027974728227441735014801995855195223534251

Look at this before you do it:http://blog.csdn.net/yuzhiwei1995/article/details/47909743

N==0 Output 1 Divine data, WA n times this place

Stick two kinds of large number carry way

#include <stdio.h>
#include <string.h>
int a[300][2010];
void Fun ()
{
	int i,j;
	memset (A,0,sizeof (a));
	A[0][0]=1;
	A[1][0]=1;
	a[2][0]=3;
	int t;
	for (I=3;i<=260;++i)
	{
		int k=0;
		for (j=0;j<=2000;++j)
		{
			A[i][j] + = A[i-1][j] + 2 * a[i-2][j];		
			if (a[i][j]>=10) 
			{
				a[i][j+1]=a[i][j]/10;
				a[i][j]%=10
;
}}}} int main ()
{
	int n,i;	
	Fun ();
	while (~SCANF ("%d", &n))
	{for
		(i=2000;i>0&&a[n][i]==0;--i);
		for (; i>=0;--i)
			printf ("%d", A[n][i]);
		printf ("\ n");
	}
	return 0;
}

#include <stdio.h>
#include <string.h>
int a[300][2010];
void Fun ()
{
	int i,j;
	memset (A,0,sizeof (a));
	A[0][0]=1;
	A[1][0]=1;
	a[2][0]=3;
	int t;
	for (I=3;i<=260;++i)
	{
		int k=0;
		for (j=0;j<=2000;++j)
		{
			t = a[i-1][j] + 2 * a[i-2][j] + k;
			K=T/10;
			a[i][j]=t%10
;
}}} int main ()
{
	int n,i;	
	Fun ();
	while (~SCANF ("%d", &n))
	{for
		(i=2000;i>0&&a[n][i]==0;--i);
		for (; i>=0;--i)
			printf ("%d", A[n][i]);
		printf ("\ n");
	}
	return 0;
}