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
-
相关阅读:
Android MVP架构分析
JavaEE基本了解
学习面试题Day09
使用反射来实现简单工厂模式
Android Material Design简单使用
c语言 找最小值
c++ 计算指定半径圆的面积
c++ 字符串拷贝以及合并
python yaml文件读写
python 列表元素替换以及删除
-
原文地址:https://www.cnblogs.com/yxysuanfa/p/7189762.html