fork download
  1. #include <iostream>
  2. using namespace std;
  3.  
  4. unsigned long long fibs[] = { 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, 2584, 4181, 6765, 10946, 17711, 28657, 46368, 75025, 121393, 196418, 317811 };
  5.  
  6. void print_fib(const int n) {
  7. if (0 <= n && n < (sizeof(fibs) / sizeof(fibs[0]) ) )
  8. cout << "Fib(" << n << ") = "<< fibs[n] << "\n";
  9. else
  10. cout << "n = " << n << " is out of range\n";
  11. }
  12.  
  13. int main() {
  14.  
  15. for (int i = 0; i < 30; i++) {
  16. print_fib(i);
  17. }
  18.  
  19. return 0;
  20. }
Success #stdin #stdout 0s 4376KB
stdin
Standard input is empty
stdout
Fib(0) = 1
Fib(1) = 1
Fib(2) = 2
Fib(3) = 3
Fib(4) = 5
Fib(5) = 8
Fib(6) = 13
Fib(7) = 21
Fib(8) = 34
Fib(9) = 55
Fib(10) = 89
Fib(11) = 144
Fib(12) = 233
Fib(13) = 377
Fib(14) = 610
Fib(15) = 987
Fib(16) = 1597
Fib(17) = 2584
Fib(18) = 4181
Fib(19) = 6765
Fib(20) = 10946
Fib(21) = 17711
Fib(22) = 28657
Fib(23) = 46368
Fib(24) = 75025
Fib(25) = 121393
Fib(26) = 196418
Fib(27) = 317811
n = 28 is out of range
n = 29 is out of range