백준 3003번 킹, 퀸, 룩, 비숍, 나이트, 폰 JAVA(자바) 문제 풀이

import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		
		int chessKing = 1;
		int chessQueen = 1;
		int chessLook = 2;
		int chessBishop = 2;
		int chessKnight = 2;
		int chessPawn = 8;

		int king = scan.nextInt();
		int queen = scan.nextInt();
		int look = scan.nextInt();
		int bishop = scan.nextInt();
		int Knight = scan.nextInt();
		int pawn = scan.nextInt();
			
		int k = chessKing - king;
		int q = chessQueen - queen;
		int l = chessLook - look;
		int b = chessBishop - bishop;
		int n = chessKnight - Knight;
		int p = chessPawn - pawn;
			
		System.out.println(k+" "+q+" "+l+" "+b+" "+n+" "+p);
			
	}

}