1013：兔子生崽

http://acm.nit.net.cn/showproblem.jsp?pid=1013

#include <stdio.h>

int a[45];
int fib(int m);

int main()
{
	int month;
	while(scanf("%d",&month) == 1)
	{
		printf("%d\n",fib(month));
	}
	return 0;
}

int fib(int m)
{

	a[0] = 1;
	a[1] = 1;
	if(m < 2) return 1;
	int i;
	for(i = 2; i < m; i++)
	{
		a[i] = a[i-1] +a [i-2];
	}
	return a[i-1];
}