summaryrefslogtreecommitdiff
path: root/codeforces.md
diff options
context:
space:
mode:
authorAnthony Wang2022-03-21 21:00:40 -0500
committerAnthony Wang2022-03-21 21:00:40 -0500
commit79005f6850e154bc3e832efc2b3389a820ccc141 (patch)
treef18834adc3ed712d1b12669498658913a80b77ce /codeforces.md
parent06dec720d5a93fb28d97199bbf7bef300b3dfc14 (diff)
1626D
Diffstat (limited to 'codeforces.md')
-rw-r--r--codeforces.md2
1 files changed, 2 insertions, 0 deletions
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