hdoj 2041 超级楼梯

初看到这题就想到fibonacci数，算了几个，果然！！

#include < iostream >
using namespace std;
int main()
{
int n,m,a[ 45 ],i;
a[ 1 ] = 0 ;
a[ 2 ] = 1 ;
a[ 3 ] = 2 ;
for (i = 4 ;i <= 40 ;i ++ )
a[i] = a[i - 1 ] + a[i - 2 ];
while (scanf( " %d " , & n) != EOF)
{
while (n -- )
{
scanf( " %d " , & m);
printf( " %d\n " ,a[m]);
}
}
return 0 ;
}

转载于:https://www.cnblogs.com/bersaty/archive/2011/06/20/2085385.html