• 문제 링크
https://www.acmicpc.net/problem/18141
• 풀이 코드
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.OutputStreamWriter;
public class Main {
public static void main(String[] args) throws IOException {
BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
int[] arr = new int[read()];
for (int i = 0; i < arr.length; i++) arr[i] = read();
bw.write(search(arr) ? "yes" : "no");
bw.flush();
}
private static boolean search(int[] arr) {
for (int i = 0; i < arr.length; i++)
for (int j = 0; j < arr.length; j++)
for (int k = 0; k < arr.length; k++)
if (i != j && i != k && j != k && (arr[i] - arr[j]) % arr[k] != 0) return false;
return true;
}
private static int read() throws IOException {
int c, n = System.in.read() & 15;
while ((c = System.in.read()) > 32) n = (n << 3) + (n << 1) + (c & 15);
return n;
}
}
'Problem Solving > Baekjoon' 카테고리의 다른 글
[백준] 9863 Calling All Programmers - Data Structure / Java (0) | 2024.05.28 |
---|---|
[백준] 25643 문자열 탑 쌓기 - Brute Force / Java (0) | 2024.05.27 |
[백준] 5947 Book Club - Brute Force / Java (0) | 2024.05.25 |
[백준] 6013 Lonesome Partners - Brute Force / Java (0) | 2024.05.24 |
[백준] 1907 탄소 화합물 - Brute Force / Java (0) | 2024.05.23 |
댓글