9 degree OJ Question 4: Fibonacci Series

/********************************** Date: * Author: sjf0115 * question: 9 degrees OJ Title 4: Fibonacci series * Source: http://ac.jobdu.com/problem.php? Cid = 1039 & pid = 3 * result: AC * Source: He Haitao: offoffoffer: famous enterprise interviewers explain typical programming issues. * conclusion: the following Fibonacci series have exceeded the representation range of int and long *************************** * ******/# include <stdio. h> # include <math. h> int main () {int N, I, j; double maid [71]; maid [0] = 0; maid [1] = 1; while (scanf ("% d", & N )! = EOF) {for (INT I = 2; I <= N; I ++) {maid [I] = maid [I-1] + maid [I-2];} printf ("%. 0lf \ n ", fig [N]);} return 0 ;}