From fc6722ad618c7bbe746c48f813ba525a7992c406 Mon Sep 17 00:00:00 2001
From: Barrett Ruth <br.barrettruth@gmail.com>
Date: Tue, 25 Mar 2025 16:24:53 -0400
Subject: [PATCH] feat(cp-log): another div. 3

---
 posts/algorithms/cp-log.html | 49 ++++++++++++++++++++++++++++++++++++
 1 file changed, 49 insertions(+)

diff --git a/posts/algorithms/cp-log.html b/posts/algorithms/cp-log.html
index cdab38a..59f3a7a 100644
--- a/posts/algorithms/cp-log.html
+++ b/posts/algorithms/cp-log.html
@@ -35,6 +35,55 @@
           <h1 class="post-title">Competitive Programming Log</h1>
         </header>
         <article class="post-article">
+          <h2>
+            <a href="https://codeforces.com/contest/2091" target="_blank"
+              >1013 (div. 3)</a
+            >&mdash;25/3/2025
+          </h2>
+          <div>
+            <p>
+              Solved in a coffee shop. More locked in than before. My best
+              performance yet. I'm changing my philosophy in these
+              contests&mdash;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 <i>code</i> and I mean
+              the whole package. Lastly, my skills in math and implementation
+              are improving bit by bit. No stopping here.
+            </p>
+            <ul>
+              <li>
+                A: rushed and panicke for no reason. Took me a few minutes to
+                realize the triviality of the solution. <b>Calm down!</b>
+              </li>
+              <li>
+                B: failed to prove solution before testing, resulting in a time
+                waste of around 10 minutes. Collected myself and proved it,
+                though
+                <b>rigor could be improved</b>.
+              </li>
+              <li>
+                C: noticed a pattern in the examples after rotating them and
+                instantly submitted. <b>Risky decision!</b> The problem is, I'm
+                unsure if I am even capable of proving the validity of the
+                solution in the first place.
+              </li>
+              <li>
+                D: afk for ~45 minutes but still heavily struggled with the
+                solution, <i>even after reducing the problem</i> to maximally
+                spreading out \(\lceil{\frac{k}{n}}\rceil\) columns. Recollected
+                myself and came up with a solution that worked for me in
+                minutes.
+              </li>
+              <li>
+                E: played with the numbers and realized the prime reduction.
+                <b>Number theory very weak</b>&mdash;this is most likely the
+                hardest problem in the category I've ever solved. Still had to
+                google sieve of eratosthenes (is this cheating?) (<b
+                  >contest as a test of implementation skills</b
+                >).
+              </li>
+            </ul>
+          </div>
           <h2>
             <a href="https://codeforces.com/contest/1878/" target="_blank"
               >900 (div. 3)</a