Minimum Perimeter of a Rectangle

Hi
I have to write function that given area as unsigned long long find the minimum perimeter of a rectangle with integer width and length. My code below

Code:

---

typedef unsigned long long ull;


ull minimum_perimeter(ull area) {
  long double a,b;
  for(a = floor(sqrt(area)),b = ceil(sqrt(area));a*b!=area;a--)
  {
    ull b_b=b;
    for(;a*b_b<area;b_b++);
    if(a*b_b==area)
      return 2*(a+b_b);
  }
  return 2*(a+b);
}

---

The function did not pass the test due to time out. Can you help me fix the code. Where is mistake, for small numbers alghortim seems to work fine.
The result can not be square. It is mean that width and length must be different value.

You call "sqrt(area)" twice; try calling it just once and assigning it to a local variable. That will only be a minor speedup; but, every little bit helps.

Tim S.

> Where is mistake, for small numbers alghortim seems to work fine.
Because the approach of "try all the possible ways" always results in "time limit exceeded" when presenting with larger numbers.

Which means you need to work smarter, not harder.

That is, you need to find a better algorithm that does substantially less work.
Not the first idea that comes into your head.

The other problem is comparing floating point results using == and !=
You risk missing actual valid answers due to rounding errors, which are likely for very large numbers.
Aside from computing the initial square roots, doing all the calculations in integer arithmetic would be my first suggestion.

Integer factorization - Wikipedia
Since a square has the minimum possible perimeter, you only need to find the first integer factor of area that's closest to sqrt(area).