From your suggestion I read the special sums problem, but couldn't find the link between both.

Active In

Competitive Programming

Featured Contributions

reply in this discussion

From your suggestion I read the special sums problem, but couldn't find the link between both.

Read more… (16 words)

reply in this discussion

reply in this discussion

Read more… (18 words)

reply in this discussion

Read more… (19 words)

reply in this discussion

reply in this discussion

Read more… (15 words)

reply in this discussion

How is this problem different form Problem AIBOHP (AIBPHOBIA), given in this playlist before this problem.

Read more… (16 words)

reply in this discussion

and that would still be better then O(sqrt n), I got your point. May be I got too silly.

BTW thank you so much.

Read more… (24 words)

reply in this discussion

Anyone please let me know what is wrong with my solution.

Read more… (14 words)

reply in this discussion

The point is that if we used sqrt(n) for narrowing that down then our overall complexity would become sqrt(n)+log n=O(sqrt(n)) so our tweak of using binary search in this case won't be useful.

Read more… (33 words)