[JAVA] 백준 - 11866: 요세푸스 문제 0

11866번: 요세푸스 문제 0 (acmicpc.net)

11866번: 요세푸스 문제 0

 

import java.util.*;

public class Main {
    public static void main(String[] args) {

        Scanner input = new Scanner(System.in);
        int n = input.nextInt();
        int k = input.nextInt();

        Queue<Integer> Josephus = new LinkedList<>();
        for (int i = 1; i<=n; i++) Josephus.add(i);

        StringBuilder output = new StringBuilder("<");
        int cnt = 0; int index = 1;
        while (cnt < n) {
            if (index % k == 0) {
                output.append(Josephus.remove());
                if (cnt!=n-1) output.append(", ");
                else output.append(">");
                cnt++;
            }
            else {
                Josephus.add(Josephus.remove());
            }
            index++;
        }

        System.out.println(output);

    }
}