[Baekjoon Online Judge] 2563 - 색종이 / Java

https://www.acmicpc.net/problem/2563

2563번: 색종이

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

public class Main {

	public static void main(String[] args) throws Exception {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st;

		int answer = 0;
		boolean[][] paper = new boolean[100][100]; // 색종이 넓이 계산할 배열

		int N = Integer.parseInt(br.readLine()); // 색종이 수
		for (int n = 0; n < N; n++) {
			st = new StringTokenizer(br.readLine());
			int x = Integer.parseInt(st.nextToken());
			int y = Integer.parseInt(st.nextToken());

			// 해당 넓이에 true
			for (int i = x; i < (x + 10); i++) {
				for (int j = y; j < (y + 10); j++) {
					paper[i][j] = true;
				}
			}
		}
		for (int i = 0; i < paper.length; i++) {
			for (int j = 0; j < paper[i].length; j++) {
				// true면 answer++
				if (paper[i][j] == true) {
					answer++;
				}
			}
		}
		System.out.println(answer);
	}
}