1 solutions
-
0
C :
#include<stdio.h> #define N 12 void Fibonacci(int f[],int n); int main() { int f[N],i; Fibonacci(f,N); printf("%d\n",f[N-1]); return 0; } void Fibonacci(int f[],int n) { int i; f[0]=1; f[1]=2; for(i=2;i<n;i++) { f[i]=f[i-1]+f[i-2]; } }C++ :
#include<stdio.h> #define N 12 void Fibonacci(int f[],int n); int main() { int f[N],i; Fibonacci(f,N); printf("%d\n",f[N-1]); return 0; } void Fibonacci(int f[],int n) { int i; f[0]=1; f[1]=2; for(i=2;i<n;i++) { f[i]=f[i-1]+f[i-2]; } }
- 1
Information
- ID
- 17223
- Time
- 1000ms
- Memory
- 2MiB
- Difficulty
- (None)
- Tags
- # Submissions
- 0
- Accepted
- 0
- Uploaded By