数组_习题：用数组输出Fibonacci数列前20项

/*
程序功能：用数组输出Fibonacci数列前20项
*/
# include <stdio.h>
# define N 20

int main(void)
{
 int a[N], i;
 
 a[0] = 1;
 a[1] = 1;
 for(i=2; i<N; ++i)
  a[i] = a[i-2] + a[i-1];
 
 printf("\n------------------ Fibonacci数列 ------------------\n");
 
 for(i=0; i<N; ++i)
 {
  if(i%4 == 0) 
   printf("\n");
  printf("a[%-2d] = %-8d", i, a[i]);
 }
 putchar('\n');

 return 0;
}
/*该程序在VC++6.0中的执行结果如下：

------------------ Fibonacci数列 ------------------

a[0 ] = 1    a[1 ] = 1    a[2 ] = 2    a[3 ] = 3
a[4 ] = 5    a[5 ] = 8    a[6 ] = 13   a[7 ] = 21
a[8 ] = 34   a[9 ] = 55   a[10] = 89   a[11] = 144
a[12] = 233  a[13] = 377  a[14] = 610  a[15] = 987
a[16] = 1597 a[17] = 2584 a[18] = 4181 a[19] = 6765

*/