Hello cf community, in this blog I tried to gather binary search problems that are worth solving and maybe makes you learn it better, if there exist any blog tell me I'll remove this

**problems**

These problems are mostly specialist/expert level based but everyone can solve them, have fun and Hope you enjoy them

Peace

Gatcha,

"binary search problems that are worth solving"

it's solvable using bs, doesn't require it, (that blog by is-this-fft who told us not to limit ourself etc)

One of the best binary search problems to start with is CodeChef - QHOUSE. An interactive problem that make you feel binary search.

Also, 670D2 - Magic Powder - 2 is very good for starters.

added

For the first problem do we need more than 30 queries?

SpoilerI was thinking of asking queries for

1.leftmost point of square

2.leftmost point of triangle

3.tip of the triangle

So log(1000)*3

Since drawing is symmetric along y axis and base is at (x,0)

Which one?

I was talking about QHOUSE suggested by arpa

since codechef is not supporting interactive due to migration of new judge

i was wondering if my approach is correct or not

Thanks, interesting problems, helped.

Can you tell some source where i can take hint of step3 of BS of EDU section?

1486D — Max Median appears twice in your list.

Also, can you recommend some harder (2100+) binary search problems

You know their idea, it makes that way easier

I'll edit the list

Here are the problems:

Range Deleting

Microtransactions (hard version)

Mr. Kitayuta vs. Bamboos

Thoroughly Bureaucratic Organization

Lemmings

Degenerate Matrix

Guess The Maximums

I liked the last div3, binary search

E. Definitely, a good practice problem for BS.How I solved (don't open unless u tried)252261223

already added