[programmers] 코딩테스트 입문 Day 11

1. 주사위의 개수

class Solution {
    public int solution(int[] box, int n) {
        int answer = 1;
        
        for(int i=0; i<box.length; i++){
           answer *= ( box[i] / n );
        }
        
        return answer;
    }
}

2. 합성수 찾기

class Solution {
    public int solution(int n) {
        int answer = 0;
        
        
        for(int i=1; i <= n; i++){
            int count = 0;
            for(int j=1; j <= i; j++){
                if(i % j == 0){
                    count++;
                } 

            }
               if(count >= 3){
                   answer++;
               }
        }
        
        return answer;
    }
}

3. 최댓값 만들기(1)

import java.util.*;

class Solution {
    public int solution(int[] numbers) {
        int answer = 0;
        
        
        Arrays.sort(numbers);
        
        answer = numbers[numbers.length-1] * numbers[numbers.length-2];
        
        return answer;
    }
}

4. 팩토리얼

class Solution {
    public int solution(int n) {
        int answer = 0;
        
        for(int i=1; i<=n; i++){
            int factorial = 1;
            for(int j=1; j<=i; j++){
                factorial *= j;
            }
            if(factorial > n){
                answer = i-1;
                break;
            } else if(factorial == n){
                answer = i;
            }
        }
        
        return answer;
    }
}