• 문제 링크
https://www.acmicpc.net/problem/8676
• 풀이 코드
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(find(arr) ? "TAK" : "NIE");
bw.flush();
}
private static boolean find(int[] arr) {
for (int i = 2; i < arr.length; i++)
if (arr[i - 2] != arr[i - 1] && arr[i - 1] != arr[i] && arr[i - 2] != arr[i]) return true;
return false;
}
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' 카테고리의 다른 글
[백준] 5359 Music - Brute Force / Java (0) | 2025.08.20 |
---|---|
[백준] 16847 Teenage Mutant - Brute Force / Java (0) | 2025.08.19 |
[백준] 2729 이진수 덧셈 - Implementation / Java (0) | 2025.08.17 |
[백준] 5363 요다 - Implementation / Java (0) | 2025.08.16 |
[백준] 1871 좋은 자동차 번호판 - Implementation / Java (0) | 2025.08.16 |
댓글