【Codility】Min-Perimeter-Rectangle ★

Problem:Codility

// you can also use includes, for example:
// #include <algorithm>
#include <cmath>
int solution(int N) {
    // write your code in C++98
    int primeNumb1 = 0;
    int primeNumb2 = 0;
    int minPerimeter = 2*(1+N);
    for(int i = 1; i <= sqrt(N); i++)
    {
        if(0 == N % i)
        {
            primeNumb1 = i;
            primeNumb2 = N/i;
            if(2 * (primeNumb1 + primeNumb2) < minPerimeter)
                minPerimeter = 2 * (primeNumb1 + primeNumb2);
        }
    }
    
    return minPerimeter;
}