1999A — A+B Again?
Video
1999B — Card Game
Video
1999C — Showering
Video
1999D — Slavic's Exam
Video
1999E — Triple Operation
Video
1999F — Expected Median
Video
1999G1 — Ruler (easy version)
Video
1999G2 — Ruler (hard version)
Video
→ Pay attention
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | jiangly | 3810 |
| 2 | Benq | 3676 |
| 3 | Kevin114514 | 3655 |
| 4 | maroonrk | 3463 |
| 5 | strapple | 3447 |
| 6 | Um_nik | 3387 |
| 7 | heuristica | 3322 |
| 8 | turmax | 3317 |
| 9 | tourist | 3307 |
| 10 | jiangbowen | 3291 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 156 |
| 2 | nik_exists | 150 |
| 2 | maspy | 150 |
| 4 | Um_nik | 141 |
| 5 | Errichto | 139 |
| 6 | adamant | 137 |
| 7 | AmShZ | 135 |
| 8 | BledDest | 132 |
| 9 | maroonrk | 131 |
| 10 | qwexd | 129 |
→ Find user
→ Recent actions
Tutorial of Codeforces Round 964 (Div. 4)
Codeforces (c) Copyright 2010-2026 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Sep/24/2026 22:03:46 (g2).
Desktop version, switch to mobile version.
Supported by
why E gives tle for O(N) solution?
Java 275163443 C++ 275165193
Shayan
It is not mentioned in the problem statement that sum of (r-l) <= 2e5 or something like that , So you need to precompute and solve
got your point! thanks :)