Unknown Language Round 4

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
130 Unknown Language Round 4 FINISHED False 10800 410021999 Nov. 20, 2011, 3 p.m.

Problems

Solved$
Index
Name
Type
Tags
Community Tag
Rating
( 1631 ) A Hexagonal numbers PROGRAMMING *special implementation 1300

B'Hexagonal numbers are figurate numbers which can be calculated using the formula hn xe2 x80 x89= xe2 x80 x892n2 xe2 x80 x89- xe2 x80 x89n. You are given n; calculate n-th hexagonal number. The only line of input contains an integer n (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89100). Output the n-th hexagonal number.'...

Tutorials

Unknown Language Round #4: editorial

Submissions

Submission Id
Author(s)
Index
Submitted
Verdict
Language
Test Set
Tests Passed
Time taken (ms)
Memory Consumed (bytes)
Tags
Rating
3672701 Victoralin10 A May 5, 2013, 1:57 p.m. OK Befunge TESTS 30 125 0 1300
3621213 Phoenyx A April 25, 2013, 3:10 p.m. OK Befunge TESTS 30 125 0 1300
3064970 hariprasath A Feb. 2, 2013, 5:09 p.m. OK Befunge TESTS 30 125 0 1300
3812799 Nakilon A June 2, 2013, 1:44 a.m. OK Befunge TESTS 30 140 0 1300
3786082 SuprDewd A May 28, 2013, 4:38 a.m. OK Befunge TESTS 30 140 0 1300
3669369 Omelianenko A May 4, 2013, 1:43 p.m. OK Befunge TESTS 30 140 0 1300
3419792 alp-arslan A March 29, 2013, 3:27 p.m. OK Befunge TESTS 30 140 0 1300
881070 shevchen A Nov. 20, 2011, 3:26 p.m. OK Befunge TESTS 30 140 4300800 1300
27368351 Dr.Dendro A May 27, 2017, 6:46 a.m. OK Befunge TESTS 30 154 0 1300
21814392 IuriG g.lefundes pedroteosousa A Oct. 27, 2016, 7:49 a.m. OK Befunge TESTS 30 154 0 1300

remove filters

Back to search problems