| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | jiangly | 3631 |
| 4 | Kevin114514 | 3574 |
| 5 | maroonrk | 3521 |
| 6 | strapple | 3515 |
| 7 | Radewoosh | 3461 |
| 8 | tourist | 3428 |
| 9 | turmax | 3378 |
| 10 | Um_nik | 3376 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 162 |
| 2 | adamant | 148 |
| 3 | Um_nik | 146 |
| 4 | Dominater069 | 143 |
| 5 | errorgorn | 140 |
| 6 | cry | 138 |
| 7 | Proof_by_QED | 136 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 10 | soullless | 133 |
|
0
Maybe by the magic tab in the profile setting |
|
0
**Yes , HR should improve their end testcases, it is not fair that naive solution can pass all testcases in 5th problem. |
|
0
It was a great contest, it is an excellent challenge for be faster!! |
|
-33
Do You know if in ICPC regional judge answer is after running all test cases, or they only run until a testcase where it fails? |
|
+8
If you are in a jump n : You need to check if exist a polygon with sides of length jump[ 0 ] ,jump[ 1 ] , ...jump[ n] and the side with length x. So your answer is the minimum value of n. |
|
0
Yes , I solved it sorting in decreasing way. |
| Name |
|---|


