Responsive image

Problem 1048 --Fibonacci Numbers

1048: Fibonacci Numbers

Time Limit: 1 Sec  Memory Limit: 128 MB
Submit: 4  Solved: 1
[Submit][Status][Web Board][Creator:]

Description

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.

Input

100

Output

354224848179261915075

Sample Input

100

Sample Output

354224848179261915075

HINT

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

has 4 digits.

Source

[Submit][Status]
ACM算法攻关部
  • Anything about this OnlineJudge, Please Contact Administrator. Click add QQ

    OJ system based on HUSTOJ Project , UI based on Twitter Bootstrap

    Copyright 2016 ACM算法攻关部
    关于网站改版