/*
 * Fibonacci numbers F[n] = F[n-1] + F[n-2], F[0] = 0, F[1] = 1
 * Use the forward recurrence relation
 */

#include <stdio.h>

#define N 20

int main(void) {
    int i, j, k;
    int p;

    k = 0;  /* F[0] */
    j = 1;  /* F[1] */
    printf("  F[%2d] = %5d\n", p=0, k);
    printf("  F[%2d] = %5d\n", p=1, j);
    
    for(p = 2; p < N; p++){
        i = j + k;                          /* F[n] = F[n-1] + F[n-2] */
        printf("  F[%2d] = %5d\n", p, i);
        k = j;
        j = i;
    }

    return(0);
}