Part 2 is pretty slow, since we just reuse our fast solution for part 1. This means we have to check 4000000 which could be reduced a bit by using a loop. It is tolerably slow, so whatever. (Overall this problem would have been more fun if the space to check was smaller.) Change-Id: I1203330fe0364894cfe0318376e583868937b5bd Reviewed-on: https://cl.tvl.fyi/c/depot/+/7603 Reviewed-by: sterni <sternenseemann@systemli.org> Autosubmit: sterni <sternenseemann@systemli.org> Tested-by: BuildkiteCI |
||
---|---|---|
.. | ||
aaqaishtyaq | ||
cynthia | ||
edef | ||
ericvolp12 | ||
eta | ||
firefly | ||
flokli | ||
grfn | ||
isomer | ||
j4m3s | ||
lukegb | ||
Profpatsch | ||
qyliss | ||
riking | ||
sterni | ||
tazjin | ||
wpcarro | ||
zseri | ||
tvlbot.jpg |