[Algorithm / Programmers] 기사단원의 무기

---

[Version]
⦁ 2024.04.01 / [Algorithm / Programmers] 기사단원의 무기

 

class Solution {
    public int solution(int number, int limit, int power) {
        int totalScore = 0;
        
        int[] divisorCounts = new int[number + 1];
        for (int i = 1; i <= number; i++) {
            for (int j = i; j <= number; j += i) {
                divisorCounts[j]++;
            }
        }
        
        for (int i = 1; i <= number; i++) {
            if (divisorCounts[i] > limit) {
                totalScore += power;
            } else {
                totalScore += divisorCounts[i];
            }
        }
        
        return totalScore;
    }
}