hdu 1250 Hat's Fibonacci

Posted yxysuanfa

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了hdu 1250 Hat's Fibonacci相关的知识,希望对你有一定的参考价值。

点击此处就可以传送hdu 1250

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 

以上是关于hdu 1250 Hat's Fibonacci的主要内容,如果未能解决你的问题,请参考以下文章

HDU 1250 Hat's Fibonacci (递推大数加法string)

(二维数组 亿进制 或 滚动数组) Hat's Fibonacci hdu1250

HDOJ/HDU 1250 Hat's Fibonacci(大数~斐波拉契)

HDoj-1250-Hat's Fibonacci-大数

HDU1250 Hat‘s Fibonacci (大数相加)(Java题解)

hdu 1250(大整数)