Lesson08\MinPerimeterRectangle::solution()

Complexity

Conditions	4
Paths	4

Size

Total Lines	15
Code Lines	9

Duplication

Lines	0
Ratio	0 %

Importance

Changes

0

<?php
    public function solution($N)
    {
        $root = (int) ceil(sqrt($N));
        $min = PHP_INT_MAX;
        for ($i = 1; $i <= $root; $i++) {
            if ($N % $i === 0) {
                $j = $N / $i;
                if ($i + $j < $min) {
                    $min = $i + $j;
                }
            }
        }

        return 2 * $min;
    }
}