BOJ1158 요세푸스 문제

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

1158번: 요세푸스 문제

 

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

public class Main
{
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int k = sc.nextInt();
        
        
        int[] ans = new int[n];
        
        List<Integer> list = new LinkedList();
        
        
        for(int i=1;i<=n;i++){
            list.add(i);
        }
        int i=0;
        int i_ans=0;
        while(!list.isEmpty()){
            i = (i+k-1)%list.size();
            ans[i_ans++] = list.remove(i);
        }
        
        
        
        System.out.println(Arrays.toString(ans).replace("[","<").replace("]",">"));
        
        
	}
	
	
	
	
	
}