1 solutions
-
0
C :
#include<stdio.h> long long a[55]; void f(int n) { a[0]=0; a[1]=1; for(int i=2;i<=n;i++) { a[i]=a[i-1]+a[i-2]; } } int main() { int n; while(scanf("%d",&n)!=EOF) { f(n); printf("%lld\n",a[n]); } return 0; }C++ :
#include <iostream> #include <cstring> using namespace std; long long a[60]; void init() { memset(a,0,sizeof(a)); a[0]=0; a[1]=1; for(int i=2;i<=50;i++) { a[i]=a[i-1]+a[i-2]; } } int main() { init(); int t; while(cin>>t) { cout<<a[t]<<endl; } return 0; }
- 1
Information
- ID
- 17805
- Time
- 2000ms
- Memory
- 72MiB
- Difficulty
- (None)
- Tags
- # Submissions
- 0
- Accepted
- 0
- Uploaded By