问题1735--Fibonacci Numbers

1735: Fibonacci Numbers

[命题人 : ]
时间限制 : 1.000 sec  内存限制 : 64 MB

题目描述

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.

样例输入 Copy

100

样例输出 Copy

354224848179261915075

提示

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

来源/分类