ElJudge - Online MIPT programming contest

El Judge

Online MIPT programming contest

Forum || Register || Login || Problem set || Users rating || Online status || FAQ || acm.mipt.ru

<PREV Problem:

Solved by 1525 users: ...

The smallest solutions
User	Date	Attempt		Time	CM
DarthBeleg	`26 nov 2008`	Haskell	5	00.01	20
david_it21	`19 apr 2008`	Ruby	13	00.02	22
big-piglet	`26 sep 2007`	Ruby	1	00.02	23
fetetriste	`20 jul 2007`	Ruby	6	00.02	23
kronos	`13 sep 2009`	Ruby	7	00.02	23
sb3ar	`21 jan 2008`	Ruby	12	00.02	23
s97302	`30 jan 2010`	Ruby	13	00.02	23
s97302	`30 jan 2010`	Ruby	15	00.02	23
david_it21	`19 apr 2008`	Ruby	10	00.02	24
sb3ar	`21 jan 2008`	Ruby	11	00.02	24
sb3ar	`15 may 2007`	Ruby	5	00.02	25
david_it21	`19 apr 2008`	Ruby	5	00.02	25
alex_rodin	`22 feb 2008`	Ruby	6	00.02	25
david_it21	`19 apr 2008`	Ruby	9	00.02	25
Nakilon	`08 jan 2010`	Ruby	1	00.03	25
sb3ar	`24 nov 2007`	Ruby	6	00.02	26
david_it21	`19 apr 2008`	Ruby	8	00.02	26
s97302	`30 jan 2010`	Ruby	12	00.02	26
vi002	`12 may 2008`	Haskell	18	00.01	27
kronos	`08 apr 2007`	Ruby	2	00.02	27

Languages
C++	567
FPC	478
C	211
Java	150
Kylix	63
Ruby	41
Python	37
Scheme	15
Haskell	8
Perl	4
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

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