[백준알고리즘] #3003. 킹, 퀸, 룩, 비숍, 나이트, 폰 (by JAVA and node.js)

백준알고리즘

- Bronze 5 -

 #3003. 킹, 퀸, 룩, 비숍, 나이트, 폰 by JAVA and node.js 

 

---

 

문제

출처: https://www.acmicpc.net/problem/3003

 

---

 

풀이

▶ JAVA

import java.util.*;

public class Main {
	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		
		int king = scan.nextInt();
		int queen = scan.nextInt();
		int rook = scan.nextInt();
		int bishop = scan.nextInt();
		int knight = scan.nextInt();
		int pawn = scan.nextInt();
		
		scan.close();
		
		System.out.println((1 - king) + " " + (1 - queen) + " " + (2 - rook) + " " + (2 - bishop) + " " + (2 - knight) + " " + (8 - pawn));
		
	}
}

▶ node.js

var fs = require('fs');
var input = fs.readFileSync('/dev/stdin').toString().split(' ');

var king = input[0];
var queen = input[1];
var rook = input[2];
var bishop = input[3];
var knight = input[4];
var pawn = input[5];
console.log((1 - king) + " " + (1 - queen) + " " + (2 - rook) + " " + (2 - bishop) + " " + (2 - knight) + " " + (8 - pawn));

node.js의 경우 변수 선언 없이 바로 input[n]을 이용해도 된다.

 

---

 

결과

 

---

 

 

 

 

 

End.

heisely's 괴발개발 개발일지