Topic 1387: Fibonacci sequence

Title Description:

We all know that the Fibonacci sequence now requires you to enter an integer n, and you output the nth of the Fibonacci sequence. The Fibonacci sequence is defined as follows:

Input:

The input may contain multiple test samples, for each test case,

The input includes an integer n (1<=n<=70). Output:

corresponding to each test case,

Outputs the value of the nth Xiang Feipo sequence. Sample Input:

3

Sample output:

2

Description The recursive time-out of the subject, you must first use an array to hold the Fibonacci sequence, and the array to use a long long type.

#include <stdio.h>
int main () {
int n,i;
Long Long f[71]={0,1};
for (i=2;i<=70;i++)//Remember is equal to 70
F[I]=F[I-1]+F[I-2];
while (scanf ("%d", &n)!=eof) {
printf ("%lld\n", F[n]);
}
return 0;
}//recursion will time out