프로그래머스 - 합성수 찾기 (JAVA)

---

class Solution {
    public int solution(int n) {
        int count = 0;

        for(int i = 2; i <= n; i++){
            int diviCount = 0;
            for(int j = 1; j <= i; j++){
                if( i % j == 0){
                    diviCount++;
                }
            }
            if(diviCount > 2){
                count++;
            }
        }
        System.out.println(count);
        return count;
    }
}