백준 1145번

원본 : https://www.acmicpc.net/problem/1145

1145번: 적어도 대부분의 배수

 

풀이

import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.Arrays;

public class Main {
    private static final BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in));

    public static void main(String[] args) throws Exception {
        long[] arr = Arrays.stream(bufferedReader.readLine().split(" ")).mapToLong(Long::parseLong).toArray();
        long num = Math.min(arr[0], Math.min(arr[1], Math.min(arr[2], Math.min(arr[3], arr[4]))));

        while (true) {
            int cnt = 0;

            if (num % arr[0] == 0) {
                cnt++;
            }

            if (num % arr[1] == 0) {
                cnt++;
            }

            if (num % arr[2] == 0) {
                cnt++;
            }
            if (num % arr[3] == 0) {
                cnt++;
            }

            if (num % arr[4] == 0) {
                cnt++;
            }

            if (cnt >= 3) {
                break;
            } else {
                num++;
            }
        }

        System.out.println(num);
    }
}