백준[JAVA] 11866.요세푸스 문제 0 - 자바

📖 문제

📃 코드

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.LinkedList;
import java.util.Queue;
import java.util.StringTokenizer;

public class Main {

    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        StringBuilder sb = new StringBuilder();
        sb.append('<');
        Queue<Integer> qu = new LinkedList<Integer>();

        StringTokenizer st = new StringTokenizer(br.readLine(), " ");
        int N = Integer.parseInt(st.nextToken());

        for (int i = 0; i < N; i++) {
            qu.add(i + 1);
        }

        int K = Integer.parseInt(st.nextToken());
        // for last number is end with '>'
        while (qu.size() > 1) {
            // for 0 ~ K-1 rotate
            for (int i = 0; i < K - 1; i++) {
                int n = qu.poll();
                qu.add(n);
            }
            // append index k number
            sb.append(qu.poll()).append(", ");
        }
        sb.append(qu.poll()).append('>');
        System.out.println(sb);
    }
}

 

🔗 링크

https://www.acmicpc.net/problem/11866

11866번: 요세푸스 문제 0