Hello, Codeforces!
Now I'll show interesing problems for binary search
1) 1006C - Three Parts of the Array (1200 diffuclty)
2) 888C - K-Dominant Character (1400 diffuclty)
3) 1201C - Maximum Median (1400 diffuclty)
4) 1551B2 - Wonderful Coloring - 2 (1400 diffuclty)
5) 448D - Multiplication Table (1800 diffuclty)
6) 1118D2 - Coffee and Coursework (Hard Version) (1700 diffuclty)
7) 1066D - Boxes Packing (1800 diffuclty)
8) 1177B - Digits Sequence (Hard Edition) (1800 diffuclty)
9) 1486C1 - Guessing the Greatest (easy version) (1600 diffuclty)
1486C2 - Guessing the Greatest (hard version) (1900 diffuclty)
10) 1015E2 - Stars Drawing (Hard Edition) (1900 diffuclty)
Good Luck!!
Auto comment: topic has been updated by Mansur-M-016-26 (previous revision, new revision, compare).
Auto comment: topic has been updated by Mansur-M-016-26 (previous revision, new revision, compare).
ема хорош
Auto comment: topic has been updated by Mansur-M-016-26 (previous revision, new revision, compare).
Auto comment: topic has been updated by Mansur-M-016-26 (previous revision, new revision, compare).
Жесткий чалик