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 |
|---|---|---|---|---|---|---|
| 2159 | Codeforces Round 1058 (Div. 1) | FINISHED | False | 9000 | 16125923 | Oct. 12, 2025, 2:35 p.m. |
Solved |
Index |
Name |
Type |
Tags |
Rating |
|---|---|---|---|---|---|
| ( 8086 ) | A | MAD Interactive Problem | PROGRAMMING | constructive algorithms implementation interactive | |
| ( 2295 ) | B | Rectangles | PROGRAMMING | data structures dsu implementation two pointers | |
| ( 1672 ) | C | Twin Polynomials | PROGRAMMING | combinatorics graph matchings graphs math | |
| ( 1004 ) | D1 | Inverse Minimum Partition (Easy Version) | PROGRAMMING | binary search data structures dp greedy math two pointers | |
| ( 388 ) | D2 | Inverse Minimum Partition (Hard Version) | PROGRAMMING | dp greedy | |
| ( 194 ) | E | Super-Short-Polynomial-San | PROGRAMMING | math math meet-in-the-middle meet-in-the-middle | |
| ( 134 ) | F | Grand Finale: Snakes | PROGRAMMING | binary search interactive |
Submission Id |
Author(s) |
Index |
Submitted |
Verdict |
Language |
Test Set |
Tests Passed |
Time taken (ms) |
Memory Consumed (bytes) |
Tags |
Rating |
|---|---|---|---|---|---|---|---|---|---|---|---|
| 343324398 | mban259 | A | Oct. 12, 2025, 2:52 p.m. | OK | C# 10 | TESTS | 13 | 405 | 3379200 |
Back to search problems