[백준 11866] 요세푸스 문제 0 (java)

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

11866번: 요세푸스 문제 0

import java.io.*;
import java.util.*;

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

        int[] arr = new int[N];

        for (int i = 0; i < N; i++) {
            arr[i] = i;
        }

        int answerCount = 0;

        int index = -1;

        int leftMovePoint = K;

        System.out.print("<");
        while (answerCount < N) {
            index = (index + 1) % N;
//            System.out.println(">curr:" + arr[index]);
            if (arr[index] == -1) {
//                System.out.println("SKIP");
            } else {
                leftMovePoint--;
                if (leftMovePoint == 0) {
//                    System.out.println("V!" + arr[index]+","+(index+1));
                    System.out.print(index + 1);
                    arr[index] = -1;
                    answerCount++;
                    leftMovePoint = K;
                    if(answerCount==N){
                        break;
                    } else {
                        System.out.print(", ");
                    }
                }
            }
        }
        System.out.print(">");

    }
}