EDITORIAL BYTES2- JUNKYARD

Problem Link: http://www.codechef.com/problems/BYTES2

Difficulty: Easy-Medium

Strategy: Binary Search

Explanation:
The solution to the problem is implementing binary search on domain 1 to 10^9 and have to find largest term(x) such that (x+5)*(x-1)<=given A.
If ans comes out to be 1 print -1 because with size 1 there doesn’t exist any area.

//