| # | 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 |
| # | 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 |
|
0
Got it. Thanks |
|
0
which leads to 2 | n and . Doubt 1- What is the meaning of 2 | n in the Editorial part of C? Similarly, for each exactly n−1 numbers in q3,q4,⋯,q2n, their product will be −1, which leads to q3=q4=⋯=q2n. Doubt 2- How all these numbers are equal. It may be possible that some of them will be 1 too while odd number of them will be -1 to get overall -1. mazihang2022 |
|
0
Can anyone please tell me why I am getting WA in the following solution for E? Problem E |
|
0
Got it. Thanks a lot. |
|
0
I am trying to implement B by the Binary Search Method given in the Editorial. I am not able to get why it is not passed if we use long double instead of long int in the calculation of diff in the following code. Can anyone help? Brovko shnirelman If we replace ld by ll in diff then it passes the TC. Link: https://codeforces.me/contest/1730/submission/185451105 |
|
0
C seems to be almost the same as that of Problem 1462D Link |
|
0
Got it as the length of the good subarray can't exceed 4. |
|
0
Can Any one please help me to understand how the time complexity is computed as O(n) for the solution C present in the editorial? |
|
+58
Problem Statements seem too much messy. |
|
0
Can anyone please help why I am getting runtime error if I shift the position of s.erase(it1); after the auto it2 = s.find(y); present in the editorial solution. Here is the link to the solution Editorial Solution |
|
+16
This editorial is awesome as it totally focuses on concepts instead of spoon-feeding. |
