기사단원의 무기 : 약수 구하기

#include <string>
#include <vector>
#include <iostream>

using namespace std;

int solution(int number, int limit, int power) {
    int answer = 0;
    int i, j;
    
    vector<int> number_of_div;
    for(i = 1; i <= number; i++)
    {
        int count = 0;
        for(j = 1; j*j <= i; j++)
        {
            if(j * j == i){
                count += 1;
            }
            else if(i % j == 0){
                count += 2;
            }
        }
        number_of_div.push_back(count);
    }
    
    //print 약수
    cout << "구한 약수들\n";
    for(i = 0; i < number_of_div.size(); i++){
        cout << number_of_div[i] << " ";
    }
    cout << "\n";
    
    for(i = 0; i < number_of_div.size(); i++){
        if(number_of_div[i] > limit){
            answer += power;
        }
        else{
            answer += number_of_div[i];
        }
    }
    
    return answer;
}