Codeforces Round 990 (Div. 1)

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
2046 Codeforces Round 990 (Div. 1) FINISHED False 7200 11230460 Dec. 3, 2024, 6:25 a.m.

Problems

Solved$
Index
Name
Type
Tags
Community Tag
Rating
( 62 ) F2 Yandex Cuneiform (Hard Version) PROGRAMMING constructive algorithms data structures greedy

B''...

Tutorials

Submissions

Submission Id
Author(s)
Index
Submitted
Verdict
Language
Test Set
Tests Passed
Time taken (ms)
Memory Consumed (bytes)
Tags
Rating
294720930 hitonanode F2 Dec. 4, 2024, 6:02 a.m. OK C++20 (GCC 13-64) TESTS 175 171 4300800
294606357 antontrygubO_o F2 Dec. 3, 2024, 11:39 a.m. OK C++20 (GCC 13-64) TESTS 175 312 15769600
294714397 maspy F2 Dec. 4, 2024, 4:38 a.m. OK C++20 (GCC 13-64) TESTS 175 405 61440000
294635965 Benq F2 Dec. 3, 2024, 2:22 p.m. OK C++23 (GCC 14-64, msys2) TESTS 175 577 34816000

remove filters

Back to search problems