Solved by 2099 users: ...
UserDateAttemptTimeCMSC
DarthBeleg`26 nov 2008`Haskell500.0120
david_it21`19 apr 2008`Ruby1300.0222
big-piglet`26 sep 2007`Ruby100.0223
fetetriste`20 jul 2007`Ruby600.0223
kronos`13 sep 2009`Ruby700.0223
sb3ar`21 jan 2008`Ruby1200.0223
s97302`30 jan 2010`Ruby1300.0223
s97302`30 jan 2010`Ruby1500.0223
david_it21`19 apr 2008`Ruby1000.0224
sb3ar`21 jan 2008`Ruby1100.0224
sb3ar`15 may 2007`Ruby500.0225
david_it21`19 apr 2008`Ruby500.0225
alex_rodin`22 feb 2008`Ruby600.0225
david_it21`19 apr 2008`Ruby900.0225
Nakilon`08 jan 2010`Ruby100.0325
ksaveljev`04 jul 2011`Ruby100.0325
sb3ar`24 nov 2007`Ruby600.0226
david_it21`19 apr 2008`Ruby800.0226
s97302`30 jan 2010`Ruby1200.0226
 C++ 853 FPC 496 C 348 Java 229 Ruby 78 Kylix 66 Python 53 Scheme 24 Haskell 8 Perl 6 Lua 1
` >  >  >  >  >  >  >  >  >  > `

## Fibonacci numbers

Time limit: 5 seconds

Fibonacci numbers are defined via

F_n=F_{n-1} + F_{n-2}, F_0=1, F_1=1.

Input consists of a single integer n < 1000. Output the n-th Fibonacci number F_n.

```SAMPLE INPUT #1:
0

SAMPLE OUTPUT #1:
1

SAMPLE INPUT #2:
5

SAMPLE OUTPUT #2:
8

SAMPLE INPUT #3:
200

SAMPLE OUTPUT #3:
453973694165307953197296969697410619233826

```

Автор:
Ворожцов Артем

 © acm.mipt DevGroupThe page was generated in 180ms