Dear brethren, If you guys were to give a CF based rating to today's GCJ qualification problems what would be? A, B, C, D, E?
→ 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 | 158 |
| 2 | nik_exists | 151 |
| 3 | maspy | 149 |
| 4 | AmShZ | 144 |
| 5 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | adamant | 137 |
| 8 | BledDest | 133 |
| 9 | maroonrk | 132 |
| 10 | Proof_by_QED | 131 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2026 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Oct/28/2026 08:41:18 (g2).
Desktop version, switch to mobile version.
Supported by
$$$A - 900$$$, $$$B - 1400$$$, $$$C - 1500$$$, $$$D - 1900$$$ and $$$E - 2100$$$
B's hidden test case was hard.(atleast for me)
C was definitely more than 1600.
dont know about D and E.
Actually the dp solution for B is very easy to implement, and you don't need to worry about case analysis. C was also much easier if we started backwards, and built our answer from that.
much easier if we started backwardsOh that's what she said.
.
.
.
I meant recursive DP xD