diff options
| author | Anthony Wang | 2022-03-20 19:17:49 -0500 |
|---|---|---|
| committer | Anthony Wang | 2022-03-20 19:17:49 -0500 |
| commit | 06dec720d5a93fb28d97199bbf7bef300b3dfc14 (patch) | |
| tree | 6f9e4efe38ef4c54510bd8228663980659271c66 | |
| parent | 9fb756b80bbcf3e6c86213012cb0e62dca0db486 (diff) | |
Implemented 1604F
| -rw-r--r-- | codeforces.md | 2 |
1 files changed, 1 insertions, 1 deletions
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~~ |