Hat's Fibonacci |
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) |
Total Submission(s): 2040 Accepted Submission(s): 795 |
Problem Description
A Fibonacci sequence is calculated by adding the previous two members the sequence, with the first two members being both 1.
F(1) = 1, F(2) = 1, F(3) = 1,F(4) = 1, F(n>4) = F(n - 1) + F(n-2) + F(n-3) + F(n-4) Your task is to take a number as input, and print that Fibonacci number. |
Input
Each line will contain an integers. Process to end of file.
|
Output
For each case, output the result in a line.
|
Sample Input
100 |
Sample Output
4203968145672990846840663646 Note: No generated Fibonacci number in excess of 2005 digits will be in the test data, ie. F(20) = 66526 has 5 digits. |
Author
戴帽子的
|
Recommend
Ignatius.L
大数相加
二维数组一个一个保留 4位
不知道为什么 判断的时候 直接判断不行 得重新循环判断
ac代码
|
Hat's Fibonacci
最新推荐文章于 2023-07-28 01:11:58 发布