ABBYY Cup 3.0

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
316 ABBYY Cup 3.0 FINISHED False 14400 366051585 June 12, 2013, 1 p.m.

Problems

Solved
Index
Name
Type
Tags
Rating
( 2696 ) A1 Special Task PROGRAMMING greedy 1100
( 2162 ) A2 Special Task PROGRAMMING math 1400
( 1389 ) B1 EKG PROGRAMMING brute force dfs and similar 1600
( 1602 ) B2 EKG PROGRAMMING dfs and similar dp 1600
( 560 ) C1 Tidying Up PROGRAMMING flows 2200
( 637 ) C2 Tidying Up PROGRAMMING flows graph matchings 2300
( 535 ) D1 PE Lesson PROGRAMMING brute force dp 2300
( 464 ) D2 PE Lesson PROGRAMMING dp 2300
( 611 ) D3 PE Lesson PROGRAMMING dp math 2400
( 1489 ) E1 Summer Homework PROGRAMMING brute force data structures 1500
( 401 ) E2 Summer Homework PROGRAMMING data structures math 2400
( 534 ) E3 Summer Homework PROGRAMMING data structures math 2500
( 181 ) F1 Suns and Rays PROGRAMMING dfs and similar implementation 2500
( 167 ) F2 Suns and Rays PROGRAMMING 2500
( 183 ) F3 Suns and Rays PROGRAMMING constructive algorithms dfs and similar implementation 2600
( 979 ) G1 Good Substrings PROGRAMMING hashing strings 1700
( 477 ) G2 Good Substrings PROGRAMMING string suffix structures 2200
( 503 ) G3 Good Substrings PROGRAMMING string suffix structures 2800

Submissions

No solutions yet.