[백준] 1158번 요세푸스 (java)

www.acmicpc.net/problem/1158

1158번: 요세푸스 문제

 

import java.util.ArrayList;
import java.util.Scanner;

public class Main {
		static int n,k;
		public static void main(String[] args) {
			Scanner sc=new Scanner(System.in);
			n=sc.nextInt();
			k=sc.nextInt();
			int idx=k-1;
			ArrayList<Integer> arr=new ArrayList<>();
			for (int i = 0; i < n; i++) {
				arr.add(i+1);
			}
			System.out.print("<");
			while(arr.size()>0) {
				System.out.print(arr.get(idx));
				if(arr.size()>1) {
					System.out.print(", ");
				}
				arr.remove(idx);
				if(arr.size()>0)
				idx=(idx+k-1)%arr.size();
			}
			System.out.print(">");
		}
}