费波纳契数d动态规划实现

#include <stdio.h>
static int record[40]={0};
void count(int n){
	record[0]=1;
	record[1]=1;
	for(int i=2;i<n;i++)
		record[i]=record[i-1]+record[i-2];
}
main(){
	count(20);
	for(int i=0;i<20;i++)
 			printf("%d\n",record[i]);
}

运行结果