From 79005f6850e154bc3e832efc2b3389a820ccc141 Mon Sep 17 00:00:00 2001
From: Anthony Wang
Date: Mon, 21 Mar 2022 21:00:40 -0500
Subject: 1626D

---
 codeforces.md | 2 ++
 1 file changed, 2 insertions(+)

diff --git a/codeforces.md b/codeforces.md
index addf135..1f93e26 100644
--- a/codeforces.md
+++ b/codeforces.md
@@ -551,3 +551,5 @@
 - ~~1650G: Mostly BFS but the overcounting is very tricky to avoid, but you can think about what the longer paths look like to find a way to only count them once, basically when they diverge from the short paths~~
 
 - ~~1604F: Don't use binary search because it's cancerous to code, loop over every power of two instead which is much easier~~
+
+- 1626D: Basically brute-force, so code something up instead of doing nothing and it's not difficult to come up with the solution, also watch out for __builtin_clz corner cases such as -1
-- 
cgit v1.2.3-70-g09d2