→ Pay attention
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 4 | jiangly | 3583 |
| 5 | strapple | 3515 |
| 6 | tourist | 3470 |
| 7 | dXqwq | 3436 |
| 8 | Radewoosh | 3415 |
| 9 | Otomachi_Una | 3413 |
| 10 | Um_nik | 3376 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 157 |
| 2 | adamant | 153 |
| 3 | Um_nik | 146 |
| 3 | Proof_by_QED | 146 |
| 5 | Dominater069 | 145 |
| 6 | errorgorn | 141 |
| 7 | cry | 139 |
| 8 | YuukiS | 135 |
| 9 | TheScrasse | 134 |
| 10 | chromate00 | 133 |
→ Find user
→ Recent actions
Comments
|
0
deleted |
|
-12
This is awesome. |
|
On
aropan →
Codeforces Round #675 (Div. 2) based on Qualification Andersen Programming Contest 2020, 6 years ago
0
nevermind |
|
0
Issue was integer overflow not that log function. |
|
0
deleted |
|
+2
When you will get to know the solution of A, then you will be surprised possibly. I was laughing at myself. peace!! |
|
+9
Segment trees take 4*n space. So it won't be a problem with MLE. |
|
0
Can we do Div4-E with segment trees? |
|
+1
thanks for the help!! |
|
0
In div2-C, for the test case:- n=2 array={0,1} why the answer is "NO"?Please explain it someone. |
Codeforces (c) Copyright 2010-2026 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Apr/29/2026 14:35:55 (g2).
Desktop version, switch to mobile version.
Supported by
