From 06dec720d5a93fb28d97199bbf7bef300b3dfc14 Mon Sep 17 00:00:00 2001
From: Anthony Wang
Date: Sun, 20 Mar 2022 19:17:49 -0500
Subject: Implemented 1604F

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

diff --git a/codeforces.md b/codeforces.md
index be243bb..addf135 100644
--- a/codeforces.md
+++ b/codeforces.md
@@ -550,4 +550,4 @@
 
 - ~~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
+- ~~1604F: Don't use binary search because it's cancerous to code, loop over every power of two instead which is much easier~~
-- 
cgit v1.2.3-70-g09d2