Fibonacci Numbers
memory limit: 65536KB time limit: 500MS
accept: 22 submit: 29
Description
A Fibonacci sequence is calculated by adding the previous two members of the sequence, with the first two members being both 1.
f(1) = 1, f(2) = 1, f(n > 2) = f(n - 1) + f(n - 2)
Your task is to take a number as input, and print that Fibonacci number.
Input
One integer i
Output
Output the i-th Fibonacci number.
Sample Input
100
Sample Output
354224848179261915075
Hint
No generated Fibonacci number in excess of 1000 digits will be in the test data, i.e. f(20) = 6765 has 4 digits.
Source
ZQUCPC个人赛5
Author
Waterloo local
题意:
输出斐波那契数列的第n项。
错误做法:
打表时数组开小了。
问题的分析与解题思路:
这个题以前做过,需要用高精度解决。预先打表,然后根据输入的数输出即可。
AC代码:
算法复杂度分析:
时间复杂度是o(n^2)
算法的优缺点分析和改进:
可以提高数组的利用率,或者其他的高精度保存方法来提高效率。
总结:
水题一道,之前做这题时学会了高精度的处理。