| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | jiangly | 3670 |
| 3 | Kevin114514 | 3657 |
| 4 | maroonrk | 3355 |
| 5 | Um_nik | 3353 |
| 6 | squareOf105 | 3346 |
| 7 | tourist | 3343 |
| 8 | strapple | 3324 |
| 9 | heuristica | 3322 |
| 10 | jiangbowen | 3291 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 158 |
| 2 | nik_exists | 150 |
| 2 | maspy | 150 |
| 4 | AmShZ | 143 |
| 5 | Um_nik | 141 |
| 6 | Errichto | 139 |
| 7 | adamant | 137 |
| 8 | BledDest | 134 |
| 9 | maroonrk | 133 |
| 10 | qwexd | 130 |
|
-8
I had to wake up on my alarm clock on my day off so as not to oversleep the contest ( -_-)" |
|
+65
best round i didnt tested |
|
On
Endagorion →
Codeforces Round 596 (Div.1, Div.2) and Technocup — Elimination Round 2, 7 years ago
0
But it still doesnt matter :D |
|
On
Endagorion →
Codeforces Round 596 (Div.1, Div.2) and Technocup — Elimination Round 2, 7 years ago
-6
idk how it sounds in English (i use Rus language as u can see), but in the condition it is said to find PAIRS OF NUMBERS. Pair of one and one? May be my bad but i really confused |
|
On
Endagorion →
Codeforces Round 596 (Div.1, Div.2) and Technocup — Elimination Round 2, 7 years ago
-8
A moment of entertaining terminology: commutativity. We can get i = 6 and j = 1; a[i] * a[j] == a[j] * a[i] == 1; F A N T A S T I C |
|
On
Endagorion →
Codeforces Round 596 (Div.1, Div.2) and Technocup — Elimination Round 2, 7 years ago
-8
if we take two elements, the position of one will be guaranteed to be greater than the position of the second. Two elements do not stand in one position. This line just makes no sense. As well as the case when we can take the same numbers. They are either the same or one is larger than the second. In short, this absurdity cost me one task |
|
On
Endagorion →
Codeforces Round 596 (Div.1, Div.2) and Technocup — Elimination Round 2, 7 years ago
-74
Well done guys |
|
-55
So where is div3 for guys who cant solve div2.A like me? :D |
|
+28
Just missclick sorry dude |
| Name |
|---|


