Submission

-----TTTTT

Score: 0

User: smart

Problemset: อนุกรม

Language: c

Time: 1.034 second

Submitted On: 2024-10-16 17:40:34

#include<stdio.h>
#include<string.h>
#include<math.h>

int fib(int n){
	if(n<=1){
		return n;
	}
	else{
		return fib(n-1)+fib(n-2);
	}
}

int main(){
	
	int n,i;
	
	scanf("%d",&n);
	int f[n];
	for (i = 0; i < n; i++) {
        f[i] = fib(n);
        
    }
    printf("%d",f[i]);
	
	return 0;
}