/*
 * Fibonacci numbers: F[n] = F[n-1] + F[n-2], F[0] = 0, F[1] = 1
 */

#include <stdio.h>

int main() {
    int i = 1, j = 0, k, n;     /* k <--> F[n], i <--> F[n-1], j <--> F[n-2] */

    printf("%2d     %5d\n", 0, j);
    printf("%2d     %5d\n", 1, i);

    for (n = 2; n < 20; n++) {
        k = i + j;
        printf("%2d     %5d\n", n, k);
        j = i;
        i = k;
    }

    return(0);
}