→ Pay attention
→ 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 | 143 |
| 5 | Errichto | 139 |
| 6 | adamant | 137 |
| 7 | AmShZ | 135 |
| 8 | maroonrk | 133 |
| 9 | BledDest | 132 |
| 10 | qwexd | 129 |
→ Find user
→ Recent actions
Comments
|
0
Nice Contest..problem set was really good. |
|
0
No.I can't memorize bitset..please help..i can't understand how to memorize bitset. |
|
0
actually i need bitset greater than 1000(as given array size of my problem is 1000).i want to solve a problem with bitmask dp..as the size of array is 1000 so i thought can i use bitset to handle it..but i can't memorize this bitset.. |
|
0
how can i memorige bitset of lenth 1010(bitset<1010>) or greater.. |
Codeforces (c) Copyright 2010-2026 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Sep/23/2026 15:15:20 (g2).
Desktop version, switch to mobile version.
Supported by
