fork download
  1. #include <stdio.h>
  2.  
  3. void fibonnaci(int fib_ptr[], int size){
  4. if(size < 1)
  5. return;
  6. fib_ptr[0] = 0;
  7. if(size == 1)
  8. return;
  9. fib_ptr[1] = 1;
  10. if(size == 2)
  11. return;
  12. fib_ptr = &fib_ptr[2];
  13.  
  14. for (int i = 2; i < size; ++i){
  15. *fib_ptr = *(fib_ptr-1) + *(fib_ptr-2);
  16. fib_ptr++;
  17. }
  18. }
  19.  
  20. int sum(int array[], int size){
  21. int sum = 0;
  22.  
  23. for (int i = 0; i < size; ++i)
  24. sum += array[i];
  25.  
  26. return sum;
  27. }
  28.  
  29. int main (void){
  30. int fib[20];
  31.  
  32. fibonnaci(&fib[0], 20);
  33.  
  34. int s = sum(&fib[0], 20);
  35.  
  36. printf("The first 20 Fibonnaci numbers are : \n");
  37. for(int i = 0; i < 20; ++i)
  38. printf("%d \n", fib[i]);
  39. printf("The sum of these numbers is : %d\n", s);
  40.  
  41. return 0;
  42. }
Success #stdin #stdout 0s 2112KB
stdin
Standard input is empty
stdout
The first 20 Fibonnaci numbers are : 
0 
1 
1 
2 
3 
5 
8 
13 
21 
34 
55 
89 
144 
233 
377 
610 
987 
1597 
2584 
4181 
The sum of these numbers is : 10945