[백준/Java] 3003번 킹, 퀸, 룩, 비숍, 나이트, 폰

 

 

 

 

 

문제

 

 

 

정답 풀이

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

public class Main {
    public static void main(String[] args) throws IOException {

        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

        int king = 1;
        int queen = 1;
        int rook = 2;
        int bishop = 2;
        int knight = 2;
        int pawn = 8;

        StringTokenizer st = new StringTokenizer(br.readLine(), " ");
        king -= Integer.parseInt(st.nextToken());
        queen -= Integer.parseInt(st.nextToken());
        rook -= Integer.parseInt(st.nextToken());
        bishop -= Integer.parseInt(st.nextToken());
        knight -= Integer.parseInt(st.nextToken());
        pawn -= Integer.parseInt(st.nextToken());

        System.out.print(king + " ");
        System.out.print(queen + " ");
        System.out.print(rook + " ");
        System.out.print(bishop + " ");
        System.out.print(knight + " ");
        System.out.print(pawn + " ");

    }
}

• 메모리 15864KB
• 시간 148ms

이것도 간단했어요!

심화 카테고리에 있길래 어려울까봐 겁먹었는데 아직은 괜찮네요..!