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 |
|---|---|---|---|---|---|---|
| 1688 | Codeforces Round 796 (Div. 2) | FINISHED | False | 7200 | 89911448 | June 3, 2022, 2:35 p.m. |
Solved |
Index |
Name |
Type |
Tags |
Rating |
|---|---|---|---|---|---|
| ( 22193 ) | A | Cirno's Perfect Bitmasks Classroom | PROGRAMMING | bitmasks brute force constructive algorithms | |
| ( 18562 ) | B | Patchouli's Magical Talisman | PROGRAMMING | bitmasks constructive algorithms greedy sortings | |
| ( 8412 ) | C | Manipulating History | PROGRAMMING | math strings |
Submission Id |
Author(s) |
Index |
Submitted |
Verdict |
Language |
Test Set |
Tests Passed |
Time taken (ms) |
Memory Consumed (bytes) |
Tags |
Rating |
|---|---|---|---|---|---|---|---|---|---|---|---|
| 159429056 | RieBi | A | June 3, 2022, 7:40 p.m. | OK | C# 10 | TESTS | 6 | 46 | 0 | ||
| 159428918 | RieBi | A | June 3, 2022, 7:38 p.m. | OK | C# 10 | TESTS | 6 | 46 | 0 |
Back to search problems