| # | 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 |
|
+19
The test cases for this problem are really weak. I found this $$$O(N^2)$$$ brute-force solution that got AC smoothly. It seems the worst-case scenario (an empty set where $$$a_i = 0$$$ for all $$$i$$$) was completely missing from the tests. Submission: https://codeforces.me/contest/2263/submission/390480145 |
|
+9
Egypt, Luxor University, El3omr L7za Wl i msh mla7za, Abdulrahman, Hussein_Yasser, MahmoudERayes |
|
+13
in Div.2 : Every successful submission for the same problem after the first one gives you -50 score points. |
|
-6
Do you have a GF? |
|
-6
As a participant I hope to get 1200+ rating or even better, Pupil **** |
|
0
As a participant I hope to get 1200+ rating or even better, Pupil |
|
0
rename this contest to Div.2 ): |
|
+11
I hope rating changes will update before i get to sleep. |
|
+3
I hope rating changes will update before i get to sleep.standings |
|
0
I agreeee with u |
