1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21
int fib(int); int main() { int i = 0; for (i = 1; i <= 20; ++i) { print(fib(i)); } return 0; } int fib(int n) { if (n <= 2) { return 1; } return fib(n - 1) + fib(n - 2); }