From 43a8e25e4e803794fbded027621210fe761314cc Mon Sep 17 00:00:00 2001
From: Anthony Wang
Date: Wed, 16 Mar 2022 16:10:58 -0500
Subject: Implemented 1650G

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

diff --git a/codeforces.md b/codeforces.md
index c093488..756d117 100644
--- a/codeforces.md
+++ b/codeforces.md
@@ -548,4 +548,4 @@
 
 - 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
+- ~~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~~
-- 
cgit v1.2.3-70-g09d2