• 문제 링크
https://www.acmicpc.net/problem/5217
• 풀이 코드
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 t = read();
while (t-- > 0) {
int n = read();
sb.append("Pairs for ").append(n).append(":");
for (int i = 1; i <= n / 2; i++)
if (n - i != i) sb.append(" ").append(i).append(" ").append(n - i).append(",");
if (sb.charAt(sb.length() - 1) != ':') sb.setCharAt(sb.length() - 1, '\n');
else sb.append("\n");
}
bw.write(sb.toString());
bw.flush();
}
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' 카테고리의 다른 글
[백준] 2108 통계학 - Implementation / Java (0) | 2025.02.20 |
---|---|
[백준] 2607 비슷한 단어 - Implementation / Java (0) | 2025.02.19 |
[백준] 1913 달팽이 - Implementation / Java (0) | 2025.02.17 |
[백준] 1924 2007년 - Implementation / Java (0) | 2025.02.16 |
[백준] 12603 Store Credit (Small), 12604 Store Credit (Large) - Brute Force / Java (0) | 2025.02.15 |
댓글