+ 1013 (div. 3)—25/3/2025 +
+
+
+ Solved in a coffee shop. More locked in than before. My best + performance yet. I'm changing my philosophy in these + contests—I want to be able to code nearly everything (except + for, for example, a lazy-propagation segment tree) from scratch. + These contests should test my ability to code and I mean + the whole package. Lastly, my skills in math and implementation + are improving bit by bit. No stopping here. +
+-
+
- + A: rushed and panicke for no reason. Took me a few minutes to + realize the triviality of the solution. Calm down! + +
- + B: failed to prove solution before testing, resulting in a time + waste of around 10 minutes. Collected myself and proved it, + though + rigor could be improved. + +
- + C: noticed a pattern in the examples after rotating them and + instantly submitted. Risky decision! The problem is, I'm + unsure if I am even capable of proving the validity of the + solution in the first place. + +
- + D: afk for ~45 minutes but still heavily struggled with the + solution, even after reducing the problem to maximally + spreading out \(\lceil{\frac{k}{n}}\rceil\) columns. Recollected + myself and came up with a solution that worked for me in + minutes. + +
- + E: played with the numbers and realized the prime reduction. + Number theory very weak—this is most likely the + hardest problem in the category I've ever solved. Still had to + google sieve of eratosthenes (is this cheating?) (contest as a test of implementation skills). + +