Each case contains a number n and you are expected to calculate Fn.(0<=n<=30) 。
For each case, print a number Fn on a separate line,which means the nth Fibonacci Number.
1
1
#include <stdio.h> long long int Fibonacci(int n){ if(n == 0) return 0; static long long int a = 0; static long long int b = 1; for(int i = 2; i <= n; ++i){ long long int t = a + b; a = b; b = t; } return b; } int main() { int n; scanf("%d",&n); printf("%lld",Fibonacci(n)); return 0; }
#include <stdio.h> int Fun(int n){ if (n == 0) { return 0; } if (n == 1) { return 1; } return Fun(n-1)+Fun(n-2); } int main() { int n; scanf("%d", &n); printf("%d", Fun(n)); return 0; }