NYOJ--252
原题链接:http://acm.nyist.net/JudgeOnline/problem.php?pid=252
01串
1 #include<stdio.h> 2 int len[45]={0}; 3 int Len(int m) 4 { 5 return len[m]=len[m]>0?len[m]:Len(m-1)+Len(m-2); 6 } 7 int main() 8 { 9 int T,m; 10 scanf("%d",&T); 11 len[1]=2;len[2]=3; 12 Len(40); 13 while(T--) 14 { 15 scanf("%d",&m); 16 printf("%d\n",len[m]); 17 } 18 return 0; 19 }