- 1887A1 - Dances (Easy version): binary search
- 1887A2 - Dances (Hard Version): binary search
- 1887B - Time Travel: binary search
- 1887C - Minimum Array: binary search
- 1887D - Split: binary search
- 1887E - Good Colorings: binary search
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3839 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | Geothermal | 3569 |
8 | ecnerwala | 3494 |
9 | Um_nik | 3396 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | Um_nik | 164 |
2 | -is-this-fft- | 162 |
3 | maomao90 | 159 |
3 | atcoder_official | 159 |
5 | cry | 158 |
5 | awoo | 158 |
7 | adamant | 155 |
8 | nor | 154 |
9 | TheScrasse | 153 |
10 | Dominater069 | 152 |
Name |
---|
I don't know if this is complaining but binary search is an important technique in cp and might be seen in many problems. Also A1A2B don't need a complicated binary search, only finding a lower bound in an array so you can't consider the problem binary search
Still Binary Search ¯\_(ツ)_/¯
Well yeah, but it's so simple use of it. It's even doable with sets
No, I'm not complaining (the contest was really good!), it's just a fun fact.
After SpeedForces, MathForces,... now we have BinarySearchForces