→ 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 | 141 |
| 5 | Errichto | 139 |
| 6 | adamant | 137 |
| 7 | AmShZ | 135 |
| 8 | BledDest | 132 |
| 9 | maroonrk | 131 |
| 10 | qwexd | 129 |
→ Find user
→ Recent actions
Comments
|
0
Any hints for problem I plz ? |
|
-7
"Brute force all possible subarrays, considering the largest number as 1023. Therefore, the worst-case scenario would involve iterating through 1024*1024*10 (number of bits) https://pastebin.com/Q9DPh3RJ |
|
On
Ormlis →
Codeforces Round #879 (Div. 2, based on All-Russian olympiad in the name of Keldysh) [Rated], 3 years ago
0
Please any hint for problem D |
|
+1
I got stuck on problem G in test 3 (I passed 157 test cases on it), but I don't understand my mistake. I used BFS, and I know the other idea of DFS, but I want to understand what went wrong with my BFS implementation. Here is the link to my code submission : https://codeforces.me/contest/1833/submission/206574785 Could anyone please help me? |
|
0
|
|
0
Yes ! U can find them easily |
|
0
The contest is nice but there are plz skip them ... bcz problems A B and C are in Youtube ! |
Codeforces (c) Copyright 2010-2026 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Sep/24/2026 06:53:00 (l2).
Desktop version, switch to mobile version.
Supported by
