• 문제 링크
https://www.acmicpc.net/problem/12603
https://www.acmicpc.net/problem/12604
• 풀이 코드
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));
StringBuilder sb = new StringBuilder();
int n = read();
for (int t = 1; t <= n; t++) {
int c = read();
int[] arr = new int[read()];
for (int i = 0; i < arr.length; i++) arr[i] = read();
sb.append("Case #").append(t).append(": ").append(find(c, arr)).append("\n");
}
bw.write(sb.toString());
bw.flush();
}
private static String find(int c, int[] arr) {
for (int i = 0; i < arr.length; i++)
for (int j = i + 1; j < arr.length; j++) if (arr[i] + arr[j] == c) return ++i + " " + ++j;
return "";
}
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' 카테고리의 다른 글
[백준] 1913 달팽이 - Implementation / Java (0) | 2025.02.17 |
---|---|
[백준] 1924 2007년 - Implementation / Java (0) | 2025.02.16 |
[백준] 15633 Fan Death - Brute Force / Java (0) | 2025.02.14 |
[백준] 17618 신기한 수 - Brute Force / Java (0) | 2025.02.13 |
[백준] 16951 블록 놀이 - Brute Force / Java (0) | 2025.02.12 |
댓글