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
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3382 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 155 |
| 2 | nik_exists | 151 |
| 3 | maspy | 149 |
| 4 | AmShZ | 145 |
| 5 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | BledDest | 136 |
| 8 | adamant | 134 |
| 9 | maroonrk | 132 |
| 10 | cry | 130 |
→ 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: Nov/06/2026 13:47:35 (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 :)