[SWEA] 1225. [S/W 문제해결 기본] 7일차 - 암호생성기

https://swexpertacademy.com/main/main.do

SW Expert Academy

 

SWEA 1225번

 

Queue를 사용해서 쉽게 풀 수 있었던 문제

 

import java.util.LinkedList;
import java.util.Queue;
import java.util.Scanner;

public class P1225 {
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        int T = 1;
        for(int t=1; t<=T; t++){
            int tc = sc.nextInt();
            Queue<Integer> q = new LinkedList<>();
            for(int i=0; i<8; i++){
                q.offer(sc.nextInt());
            }
            for(int i=1; i<=5; i++){
                int x = q.poll()-i;
                if(x<=0){
                    q.add(0);
                    break;
                } else q.add(x);
                if(i==5){
                    i=0;
                }
            }
            System.out.print("#"+tc+" ");
            for(int k : q) System.out.print(k+" ");
            System.out.println();
        }
    }
}