Lesson08\CountFactors::solution()

Complexity

Conditions	3
Paths	3

Size

Total Lines	14
Code Lines	9

Duplication

Lines	0
Ratio	0 %

Importance

Changes

0

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

        return count(array_unique($numberOfFactors));
    }
}