약수의 개수와 덧셈

#include <string>
#include <vector>

using namespace std;

int find_divisor(int num)
{
    int i, result = 0;
    
    for(i = 1; i * i <= num; i++)
    {
        if(i*i == num)
        {
            result += 1;
        }
        else if(num % i == 0)
        {
            result += 2;
        }
        else
        {
            ;
        }
    }
        
    return result;
}

int solution(int left, int right) 
{
    int answer = 0;
    int i, divisor_num;
    
    for(i = left; i <= right; i++)
    {
        divisor_num = find_divisor(i);
        if(divisor_num % 2 == 0)
        {
            answer += i;
        }
        else
        {
            answer -= i;
        }
    }
    
    return answer;
}