[레벨1] 약수의 개수와 덧셈

#include <string>
#include <vector>

using namespace std;


int solution(int left, int right) {
    int answer = 0;
    vector<int> count;
    count.resize(1001);
    for(int i = left; i <= right; ++i)
    {
        for(int j = 1; j <= i; ++j)
        {
            if(i % j == 0)
                count[i]++;
        }
    }
    
    for(int i = left; i <= right; ++i)
    {
        if(count[i] % 2 == 0)
            answer += i;
        else
            answer -= i;
    }
    return answer;
}