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 | tourist | 3880 |
2 | jiangly | 3669 |
3 | ecnerwala | 3654 |
4 | Benq | 3627 |
5 | orzdevinwang | 3612 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | jqdai0815 | 3532 |
9 | Radewoosh | 3522 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | awoo | 161 |
2 | maomao90 | 160 |
3 | adamant | 156 |
4 | maroonrk | 153 |
5 | atcoder_official | 148 |
5 | -is-this-fft- | 148 |
5 | SecondThread | 148 |
8 | Petr | 147 |
9 | nor | 144 |
10 | TheScrasse | 142 |
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