Update docs on Mon Dec 15 12:15:58 UTC 2025

Author: github-actions[bot]

2025/11/index.html

@@ -280,7 +280,7 @@ <h2 id="problem-name">Reactor</h2>
 </em></p>
 <p>We got an easy dynamic programming task for today, a refresher after the last two days of madness. Here is my input
 rendered to an image.</p>
-<video src="graph.mp4" controls autoplay loop muted playsinline width="640">
+<video src="graph.mp4" autoplay loop muted playsinline width="100%">
 </video>
 
 <p>I created a small <a href="graph.html">renderer</a> for this. (Well, ChatGPT created the render, with my input.)</p>

2025/8/index.html

@@ -281,7 +281,7 @@ <h2 id="problem-name">Playground</h2>
 <p>I decided to go with two implementations of Kruskal&#39;s algorithm, as part one and two are different enough. I didn&#39;t use a
 disjoint set representation. It&#39;s fast enough this way as well, and switching to disjoint sets would just make the code longer.</p>
 <p>This is how my graph looks with the spanning tree:</p>
-<video src="graph.mp4" controls autoplay loop muted playsinline width="640">
+<video src="graph.mp4" controls autoplay loop muted playsinline width="100%">
 </video>
 
 <p>I created a small <a href="graph.html">renderer</a> for this. (Well, ChatGPT created the render, with my guidance.)</p>