[백준, BOJ 1145] 적어도 대부분의 배수 (java)

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

메모리: 16,256 KB , 시간: 148 ms

사용 알고리즘: 브루트포스 알고리즘

728x90

---

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

public class Main {

    public static void main(String[] args) throws Exception{

        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

        StringTokenizer st = new StringTokenizer(br.readLine());
        int[] arr = new int[5];
        for (int i = 0; i < 5; i++) {
            arr[i] = Integer.parseInt(st.nextToken());
        }

        int result = 0;
        int count;
        while(++result < 1_000_001) {

            count = 0;

            for (int i = 0; i < 5; i++) {
                if(result % arr[i] == 0) count++;
            }

            if(count >= 3) break;
        }

        System.out.println(result);


    }
}