| # | 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 |
| Name |
|---|



first time seeing normal blog by CarViz
A normal blog by Carviz before GTA6?
Auto comment: topic has been updated by CarViz (previous revision, new revision, compare).
I think the runtime error is most likely caused by this line:
You access
primel[lp]before checking whetherlpis still within the bounds ofprimel. Iflpbecomes equal tolen(primel), this causes anIndexError: list index out of range.Also, this line can cause an
IndexErrorif any value inlis greater thanlen(l):For example, if
len(l) = 3butlcontains100, thendp[99]is out of bounds.You should check the constraints and make sure the prime list is large enough, and also verify that every value in
lis a valid index fordp.I guess he learned how to pocket solve
I didn't even notice that this was DP during the entire contest :(. I just assumed you can greedily take the lowest power like a noob. Wrong answered test 6.