I will suggest the following as the top four
Geometry
Mathematics
Calculus
Dynamic Programming
What do you think ? you can suggest too.
Rating changes for last rounds are temporarily rolled back. They will be returned soon.
→ Pay attention
Before contest
Spectral::Cup 2026 Round 2 (Codeforces Round 1100, Div. 1 + Div. 2)
16:39:59
Register now »
Spectral::Cup 2026 Round 2 (Codeforces Round 1100, Div. 1 + Div. 2)
16:39:59
Register now »
*has extra registration
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | tourist | 3755 |
| 3 | ecnerwala | 3696 |
| 4 | VivaciousAubergine | 3647 |
| 5 | ksun48 | 3629 |
| 6 | jiangly | 3616 |
| 7 | turmax | 3559 |
| 8 | strapple | 3486 |
| 9 | Kevin114514 | 3427 |
| 10 | Um_nik | 3376 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 162 |
| 2 | adamant | 148 |
| 3 | Um_nik | 146 |
| 4 | Dominater069 | 143 |
| 5 | errorgorn | 141 |
| 6 | cry | 138 |
| 7 | Proof_by_QED | 136 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 10 | soullless | 133 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2026 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: May/23/2026 00:55:01 (g1).
Desktop version, switch to mobile version.
Supported by
Math,with Calculus.
I can't decide it. But, one of the most complicated data structure that I have ever seen in programming contest is "Dynamic connectivity(O(log^2N) per query)".
online?
Yes, It support edge insert/erase with online. https://en.wikipedia.org/wiki/Dynamic_connectivity#Fully_dynamic_connectivity
Tasks...