| # | 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 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 155 |
| 2 | nik_exists | 151 |
| 3 | maspy | 149 |
| 4 | AmShZ | 145 |
| 5 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | BledDest | 136 |
| 8 | adamant | 134 |
| 9 | maroonrk | 132 |
| 10 | cry | 130 |
|
+3
Looking forward to the contest TheSensei |
|
0
I can't find what's wrong with my code for problem F, which uses the same approach as in the editorial. My submission — 194098249. Can anyone please point out the mistake? |
|
0
For condition 1, if l > 1 you initialized cur = 2 * (l — 1). Shouldn't this be the case only when x is at-least mn? |
|
0
In problem F, I couldn't understand from the editorial how are we checking if a certain hotness can be obtained from some elements of S in O(N) time. Any help? |
|
0
Oh, thanks! Never using log2 again :( |
|
0
Can anyone tell me what's wrong with my solution? 133471460 For example on this test case : 576460752303423488 288230376151711743 Jury's answer is 60 but according to me it should be 59. As, first 59 powers of 2 will give the sum of n-1 and 2 ^ 58 < k here. |
|
+6
Thanks for pointing that out. It worked |
|
0
Can anyone please point out what's wrong with my code for 2D? 125022309 Getting Runtime error on test 3 |
|
On
Harbour.Space →
Harbour.Space Scholarship Contest 2021-2022 (Div. 1 + Div. 2) Editorial, 5 years ago
0
This is the solution for D, I am asking for B. I got the idea of O(n^3) approach given in the tutorial, just curious what's wrong with my approach. |
|
On
Harbour.Space →
Harbour.Space Scholarship Contest 2021-2022 (Div. 1 + Div. 2) Editorial, 5 years ago
0
I tried solving B using two pointers, getting WA on TC 14. Can anyone point out what's wrong? 123384175 |
| Name |
|---|


