From 9fb756b80bbcf3e6c86213012cb0e62dca0db486 Mon Sep 17 00:00:00 2001
From: Anthony Wang
Date: Sun, 20 Mar 2022 19:17:36 -0500
Subject: 1604F

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

diff --git a/codeforces.md b/codeforces.md
index 756d117..be243bb 100644
--- a/codeforces.md
+++ b/codeforces.md
@@ -549,3 +549,5 @@
 - 1632D: Wow at least I can still solve 2000 rating problems, since it's this difficulty, you can assume it has a reasonably easy and greedy solution, and then some binary search or two pointers to speed things up
 
 - ~~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
-- 
cgit v1.2.3-70-g09d2