Codeforces Round 1099 (Div. 2)

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
2231 Codeforces Round 1099 (Div. 2) FINISHED False 7200 228299 May 21, 2026, 2:35 p.m.

Problems

Solved
Index
Name
Type
Tags
Rating
( 17611 ) A Construct an Array PROGRAMMING constructive algorithms
( 12366 ) B Another Sorting Problem PROGRAMMING constructive algorithms
( 7728 ) C Chipmunk Theo and Equality PROGRAMMING implementation
( 2305 ) D Maximum Prefix Sums PROGRAMMING constructive algorithms greedy implementation two pointers
( 638 ) E Graph Cutting PROGRAMMING dfs and similar dp trees
( 400 ) F Quadratic Jumps PROGRAMMING constructive algorithms greedy math number theory

Submissions

Submission Id
Author(s)
Index
Submitted
Verdict
Language
Test Set
Tests Passed
Time taken (ms)
Memory Consumed (bytes)
Tags
Rating
375544751 _Equinox D May 21, 2026, 4:23 p.m. OK C# 13 TESTS 15 187 22016000
375549956 forchange A May 21, 2026, 4:33 p.m. OK C# 13 TESTS 4 109 14131200

remove filters

Back to search problems