백준 1158번 요세푸스 문제 [ Java ]

 

1158번: 요세푸스 문제

import java.util.*;

public class Main {

    public static void main(String[] args) {
        ArrayList<Integer> list = new ArrayList<>();
        StringBuilder sb = new StringBuilder();
        Scanner sc = new Scanner(System.in);
        int index = 0;
        int N = sc.nextInt();
        int K = sc.nextInt()-1;
        for (int i=1; i<=N; i++) list.add(i);
        String sep = "";
        do {
            index += K;
            while (index >= list.size())
                index -= list.size();
            sb.append(sep + list.remove(index));
            sep = ", ";
        } while (!list.isEmpty());
        String.join(", ", sb);
        System.out.print("<"+sb+">");
    }
}