Hey all,
I've posted my screencast and commentary of yesterday's Kickstart 2020 round B. Check it out at https://www.youtube.com/watch?v=AP74zQ0ZmRM
BTW, stay tuned for the return of Lockout streams in the coming weeks! :)
# | User | Rating |
---|---|---|
1 | jiangly | 3640 |
2 | Benq | 3593 |
3 | tourist | 3572 |
4 | orzdevinwang | 3561 |
5 | cnnfls_csy | 3539 |
6 | ecnerwala | 3534 |
7 | Radewoosh | 3532 |
8 | gyh20 | 3447 |
9 | Rebelz | 3409 |
10 | Geothermal | 3408 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 173 |
2 | adamant | 164 |
3 | awoo | 161 |
4 | TheScrasse | 160 |
5 | nor | 159 |
6 | maroonrk | 156 |
7 | SecondThread | 152 |
8 | pajenegod | 146 |
9 | BledDest | 144 |
10 | Um_nik | 143 |
Hey all,
I've posted my screencast and commentary of yesterday's Kickstart 2020 round B. Check it out at https://www.youtube.com/watch?v=AP74zQ0ZmRM
BTW, stay tuned for the return of Lockout streams in the coming weeks! :)
Name |
---|
Auto comment: topic has been updated by scott_wu (previous revision, new revision, compare).
Only scott_wu can choose overcomplicated solutions and still finish first :P
Here's some simpler alternative solutions (which you alluded to in the analysis):
problem B: - chosen solution: binary searching - simpler solution: going backwards & rounding D down to the nearest multiple of x[i]
problem C: - chosen solution: something with a 2D array of pairs, unclear exactly how many of those values are used - simpler solution: iterate through string while maintaining a stack, latest value should be product of all loops that contain the current position