1250：Hat's Fibonacci

题目描述

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.

输入解释

Each line will contain an integers. Process to end of file.

输出解释

For each case, output the result in a line.

输入样例

输出样例

4203968145672990846840663646


Note:
No generated Fibonacci number in excess of 2005 digits will be in the test data, ie. F(20) = 66526 has 5 digits.

来自杭电HDUOJ的附加信息

Author	戴帽子的
Recommend	Ignatius.L

该题目是Virtual Judge题目，来自杭电HDUOJ

源链接： HDU-1250

最后修改于 2020-10-25T22:43:16+00:00 由爬虫自动更新

共提交 39 次

通过率 76.92%

时间上限	内存上限
2000/1000MS(Java/Others)	65536/32768K(Java/Others)