• 문제 링크
https://www.acmicpc.net/problem/21756
• 풀이 코드
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.OutputStreamWriter;
import java.util.ArrayDeque;
import java.util.Queue;
public class Main {
public static void main(String[] args) throws IOException {
BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
Queue<Integer> q = new ArrayDeque<>();
int n = read();
for (int i = 1; i <= n; i++) q.offer(i);
while ((n = q.size()) > 1) {
for (int i = 0; i < n; i++) {
if ((i & 1) == 0) q.poll();
else q.offer(q.poll());
}
}
bw.write(String.valueOf(q.poll()));
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' 카테고리의 다른 글
[백준] 22966 가장 쉬운 문제를 찾는 문제 - Implementation / Java (0) | 2025.09.26 |
---|---|
[백준] 1592 영식이와 친구들 - Implementation / Java (0) | 2025.09.25 |
[백준] 11383 뚊 - Implementation / Java (0) | 2025.09.23 |
[백준] 27035 Bovine Ballroom Dancing - Greedy / Java (0) | 2025.09.22 |
[백준] 34301 Exact Change - Greedy / Java (0) | 2025.09.21 |
댓글