From 3e2c57a7e36e5e91111d6eea9d0a5da5b89bbf18 Mon Sep 17 00:00:00 2001
From: Barrett Ruth <br.barrettruth@gmail.com>
Date: Wed, 30 Apr 2025 17:38:14 -0400
Subject: [PATCH] feat(usaco/sorting): last commentary

---
 .../algorithms/competitive-programming-log.html | 17 ++++++++++++++++-
 1 file changed, 16 insertions(+), 1 deletion(-)

diff --git a/posts/algorithms/competitive-programming-log.html b/posts/algorithms/competitive-programming-log.html
index f3f8135..bb1fa91 100644
--- a/posts/algorithms/competitive-programming-log.html
+++ b/posts/algorithms/competitive-programming-log.html
@@ -39,9 +39,24 @@
             working on my discipline and thinking but I need to improve a lot.
           </p>
           <p>
-            These problems are too easy but they help me prefer convenient
+            These problems are (mostly) easy but they help me prefer convenient
             implementation. It is time to be done with bronze.
           </p>
+          <p>
+            Implementation, loops, invariants. I still struggle to get a grasp.I
+            struggled with
+            <a
+              href="https://usaco.org/index.php?page=viewproblem2&cpid=592"
+              target="_blan"
+              >this problem</a
+            >
+            just figuring out how to do the loops and invariants. I do a loop of
+            "this works"\(\rightarrow\) "let's simplify" \(\rightarrow\) "that
+            doesn't work" \(\rightarrow ...\) over and over again...
+            <i>even when the right solution comes across my mind</i>. In this
+            case, choosing an invariant was just overwhelming. <b>The simplest
+              correct solution is always the right one</b>.
+          </p>
           <h2>
             <a href="https://usaco.guide/bronze/intro-complete" target="_blank"
               >usaco bronze: complete search</a