zoj1828||joj1949 解题报告

 

Fibonacci Numbers
Time Limit: 1 Second      Memory Limit: 32768 KB

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.


Sample Input

100


Sample Output

354224848179261915075


Note:

No generated Fibonacci number in excess of 1000 digits will be in the test data, i.e. f(20) = 6765 has 4 digits.

高精度加法计算的问题,主要有一个问题就是空间复杂度,时间复杂度过得去,但是这道题第一次提交时,我却超了内存,后来我只是加了三句delete语句就A了,我这才发现原来delete语句是这么重要(以前都没用过),仅仅是加了三句delete就使内存不超了。。。下面是A了的代码,少一句delete都A不了!!!

代码:

语言:c++

 

 

 

阅读更多
个人分类: ACM 高精度计算
上一篇 poj1001解题报告
下一篇joj 1019解题报告
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

关闭
关闭