2739Fibonacci Numbers

2739   Fibonacci Numbers

题目描述

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.

输入格式:

100

输出格式:

354224848179261915075
输入样例 复制
100
输出样例 复制
354224848179261915075

说明

No generated fibonacci number in excess of 1000 digits will be in the test data, i.e. f (20) = 6765
has 4 digits.
1
10
通过提交
时空限制1000ms/128mb
题目来源19 June, 2011 - Waterloo local contest
评测方式在线评测
题目类型大数据计算
难        度