Codeforces Beta Round 39

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
40 Codeforces Beta Round 39 FINISHED False 7200 442850399 Nov. 5, 2010, 4 p.m.

Problems

Solved$
Index
Name
Type
Tags
Community Tag
Rating
( 142 ) D Interesting Sequence PROGRAMMING math 2600

B''...

Tutorials

Submissions

Submission Id
Author(s)
Index
Submitted
Verdict
Language
Test Set
Tests Passed
Time taken (ms)
Memory Consumed (bytes)
Tags
Rating
179344 tourist D Nov. 5, 2010, 5:09 p.m. OK Delphi TESTS 74 1080 55910400 2600
179538 vepifanov D Nov. 5, 2010, 5:23 p.m. OK GNU C++ TESTS 74 160 151244800 2600
179456 ivan.popelyshev D Nov. 5, 2010, 5:18 p.m. OK Java 6 TESTS 74 110 43520000 2600
179064 Petr D Nov. 5, 2010, 4:55 p.m. OK Java 6 TESTS 74 140 43417600 2600
179930 dzhulgakov D Nov. 5, 2010, 5:48 p.m. OK Java 6 TESTS 74 190 43417600 2600
179445 winger D Nov. 5, 2010, 5:17 p.m. OK Java 6 TESTS 74 190 43417600 2600
179935 SpookyCookie D Nov. 5, 2010, 5:48 p.m. OK Java 6 TESTS 74 770 74649600 2600
179893 Anton_Lunyov D Nov. 5, 2010, 5:45 p.m. OK MS C++ TESTS 74 190 2048000 2600

remove filters

Back to search problems