Simon's Musings

I thought a little about this problem, and then had the idea that the optimal strategy would be to do a binary search between L and P in log...

I was on the right track with this one, but made a logical mistake and wasn't able to fix it before time ran out. I fixed my code in th...

I failed at online round 1 this year, although I tried twice in sub-rounds 1B and 1C. The first puzzle in sub-round 1C, Rope Intranet was ...

A trivial implementation will work fine for small cases, but not for a day with 10 8 rounds! I convinced myself (correctly I think) that I ...

The maximum possible factor is determined by the GCD between the Great Events in the past. Sorry for the unclear explanation. Anyway, the ...