1225 암호생성기

import java.util.LinkedList;
import java.util.Queue;
import java.util.Scanner;
 
public class Solution {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        for(int tc = 1; tc<11; tc++) {
            int arr[] = new int[9];
            int v = sc.nextInt();
            Queue<Integer> qu = new LinkedList<Integer>();
            for(int i = 0; i < 8; i++) {
                int e = sc.nextInt();
                qu.add(e);
            }
            int a = qu.peek();
            int cnt = 1;
            while(true) {
                a = qu.peek();
                qu.poll();
                a -= cnt;
                if(cnt == 5)
                    cnt = 0;
                cnt++;
                if(a <= 0) {
                    qu.add(0);
                    break;
                }
                qu.add(a);
            }
            System.out.print("#" + v + " ");
            for(int i : qu) {
                System.out.print(i + " ");
            }
            System.out.println();
        }
    }
}
 

큐 이용 기본