<PREV Problem:
NEXT>
Solved by 2099 users: ...
UserDateAttemptTimeCMSC
DarthBeleg26 nov 2008Haskell500.0120 
david_it2119 apr 2008Ruby1300.0222 
big-piglet26 sep 2007Ruby100.0223 
fetetriste20 jul 2007Ruby600.0223 
kronos13 sep 2009Ruby700.0223 
sb3ar21 jan 2008Ruby1200.0223 
s9730230 jan 2010Ruby1300.0223 
s9730230 jan 2010Ruby1500.0223 
david_it2119 apr 2008Ruby1000.0224 
sb3ar21 jan 2008Ruby1100.0224 
sb3ar15 may 2007Ruby500.0225 
david_it2119 apr 2008Ruby500.0225 
alex_rodin22 feb 2008Ruby600.0225 
david_it2119 apr 2008Ruby900.0225 
Nakilon08 jan 2010Ruby100.0325 
ksaveljev04 jul 2011Ruby100.0325 
sb3ar24 nov 2007Ruby600.0226 
david_it2119 apr 2008Ruby800.0226 
s9730230 jan 2010Ruby1200.0226 
Languages
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

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

<PREV | Problem set | Search related messages | NEXT>


© acm.mipt DevGroup
The page was generated in 210ms

SW soft NIX
ID = 75.101.220.230