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! :)
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! :)
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