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

문제

링크

---

코드

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 {
        int king = 1;
        int queen = 1;
        int rook = 2;
        int bishop = 2;
        int knight = 2;
        int pawn = 8;

        BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer stringTokenizer = new StringTokenizer(bufferedReader.readLine(), " ");
        king -= Integer.parseInt(stringTokenizer.nextToken());
        queen -= Integer.parseInt(stringTokenizer.nextToken());
        rook -= Integer.parseInt(stringTokenizer.nextToken());
        bishop -= Integer.parseInt(stringTokenizer.nextToken());
        knight -= Integer.parseInt(stringTokenizer.nextToken());
        pawn -= Integer.parseInt(stringTokenizer.nextToken());

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

---

리뷰

간단하게 변수에다가 직접 담는 방법을 사용하였는데 배열을 이용한 풀이도 가능할 것 같다.