Unknown Language Round 2

Solutions are presented as using the least memory and the fastest execution time. It also takes the top 10 most recent solutions from each language. If you want to limit to a specific index, click the "Solved" button and go to that problem.

ContestId
Name
Phase
Frozen
Duration (Seconds)
Relative Time
Start Time
72 Unknown Language Round 2 FINISHED False 10800 475768223 March 20, 2011, 4:10 p.m.

Problems

Solved
Index
Name
Type
Tags
Community Tag
Rating
( 2818 ) G Fibonacci army PROGRAMMING *special dp 1200

King Cambyses loves Fibonacci numbers. He has several armies. Today he wants to make a new army for himself and he wants the number of men in this army to be the n -th Fibonacci number. Given n you should find n -th Fibonacci number. The set of Fibonacci numbers start with f 0 = f 1 = 1 and for each i ≥ 2 , f i = f i - 1 + f i - 2 . Input contains a single integer n ( 1 ≤ n ≤ 20 ). Write a single integer. The n -th Fibonacci number.

Tutorials

Submissions

Submission Id
Author(s)
Index
Submitted
Verdict
Language
Test Set
Tests Passed
Time taken (ms)
Memory Consumed (bytes)
Tags
Rating
2855795 mkirsche G Dec. 30, 2012, 6:43 a.m. OK Io TESTS 20 140 307200 1200
46653175 TEAs G Dec. 5, 2018, 2:58 p.m. OK Io TESTS 20 154 0 1200
56504185 marksman_ G July 4, 2019, 7:42 a.m. OK Io TESTS 20 156 0 1200
56504173 _humble_fool G July 4, 2019, 7:42 a.m. OK Io TESTS 20 156 0 1200
46517264 gabiluciu G Dec. 2, 2018, 5:15 p.m. OK Io TESTS 20 156 0 1200
45898604 robot-dreams G Nov. 18, 2018, 1:58 a.m. OK Io TESTS 20 156 0 1200
45310491 yongwhan G Nov. 5, 2018, 3:30 a.m. OK Io TESTS 20 156 0 1200
4488281 deletelazy G Sept. 17, 2013, 1:19 p.m. OK Io TESTS 20 156 0 1200
4366764 HiruMollah G Aug. 29, 2013, 3:50 p.m. OK Io TESTS 20 156 0 1200
4032411 A_Le_K G July 6, 2013, 7:44 p.m. OK Io TESTS 20 156 0 1200

remove filters

Back to search problems