Advertisement
Guest User

Untitled

a guest
Oct 23rd, 2019
84
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.38 KB | None | 0 0
  1. #include <stdio.h>
  2. #include <stdlib.h>
  3.  
  4. int fib(int n);
  5.  
  6. int main() {
  7. int n;
  8.  
  9. printf("N? (max: 46) "); scanf("%d", &n);
  10.  
  11. printf("%d %d\n", n, fib(n));
  12. return 0;
  13. }
  14.  
  15. int fib(int n) {
  16. if (n == 0 || n == 1) return n;
  17.  
  18. int i;
  19. int * tab = malloc(sizeof(int) * (n + 1));
  20.  
  21. tab[0] = 0, tab[1] = 1;
  22.  
  23. for(i = 2; i < n + 1; i++) {
  24. tab[i] = tab[i - 1] + tab[i - 2];
  25. }
  26.  
  27. return tab[n];
  28. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement