[백준/Java] 11866 요세푸스 문제 0

AndBlack99·2026년 1월 13일

import java.util.Deque;
import java.util.ArrayDeque;
import java.util.StringTokenizer;

import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;

class Main {
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer st = new StringTokenizer(br.readLine());
        
        int N = Integer.parseInt(st.nextToken());
        int K = Integer.parseInt(st.nextToken());

        Deque<Integer> deque = new ArrayDeque<>();

        for(int i=1;i<=N;i++)
            deque.addLast(i);

        StringBuilder sb = new StringBuilder();
        sb.append("<");

        while (!deque.isEmpty()) {
            for(int i=1;i<K;i++) {
                int top = deque.pollFirst();
                deque.addLast(top);
            }
            sb.append(deque.pollFirst());
            if(!deque.isEmpty())
                sb.append(", ");
        }
        sb.append(">");
        System.out.println(sb);
    }
}

profile
Back-end Developer

0개의 댓글