From 3d9ac67c2b94370b07951b150307c8c2070d6da7 Mon Sep 17 00:00:00 2001
From: lkhyun <102892446+lkhyun@users.noreply.github.com>
Date: Wed, 5 Nov 2025 23:45:43 +0900
Subject: [PATCH] =?UTF-8?q?[20251105]=20BOJ=20/=20G4=20/=20=EC=A7=81?=
 =?UTF-8?q?=EC=82=AC=EA=B0=81=ED=98=95=EA=B3=BC=20=EC=BF=BC=EB=A6=AC=20/?=
 =?UTF-8?q?=20=EC=9D=B4=EA=B0=95=ED=98=84?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 ...5\352\263\274 \354\277\274\353\246\254.md" | 56 +++++++++++++++++++
 1 file changed, 56 insertions(+)
 create mode 100644 "lkhyun/202511/05 BOJ G4 \354\247\201\354\202\254\352\260\201\355\230\225\352\263\274 \354\277\274\353\246\254.md"

diff --git "a/lkhyun/202511/05 BOJ G4 \354\247\201\354\202\254\352\260\201\355\230\225\352\263\274 \354\277\274\353\246\254.md" "b/lkhyun/202511/05 BOJ G4 \354\247\201\354\202\254\352\260\201\355\230\225\352\263\274 \354\277\274\353\246\254.md"
new file mode 100644
index 00000000..3021f8d3
--- /dev/null
+++ "b/lkhyun/202511/05 BOJ G4 \354\247\201\354\202\254\352\260\201\355\230\225\352\263\274 \354\277\274\353\246\254.md"	
@@ -0,0 +1,56 @@
+```java
+import java.util.*;
+import java.io.*;
+
+public class Main{
+    static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+    static BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
+    static StringBuilder sb = new StringBuilder();
+    static StringTokenizer st;
+    public static void main(String[] args) throws Exception {
+        int N = Integer.parseInt(br.readLine());
+        int[][] mat = new int[N+1][N+1];
+        
+        for (int i = 1; i <= N; i++) {
+            StringTokenizer st = new StringTokenizer(br.readLine());
+            for (int j = 1; j <= N; j++) {
+                mat[i][j] = Integer.parseInt(st.nextToken());
+            }
+        }
+        
+        int[][][] sum = new int[11][N + 1][N + 1];
+        
+        for (int k = 1; k <= 10; k++) {
+            for (int i = 1; i <= N; i++) {
+                for (int j = 1; j <= N; j++) {
+                    if(mat[i][j] == k) sum[k][i][j] = 1;
+                    else sum[k][i][j] = 0;
+                    
+                    sum[k][i][j] += (sum[k][i-1][j] + sum[k][i][j-1] - sum[k][i-1][j-1]);
+                }
+            }
+        }
+        
+        int Q = Integer.parseInt(br.readLine());
+        
+        for (int q = 0; q < Q; q++) {
+            StringTokenizer st = new StringTokenizer(br.readLine());
+            int x1 = Integer.parseInt(st.nextToken());
+            int y1 = Integer.parseInt(st.nextToken());
+            int x2 = Integer.parseInt(st.nextToken());
+            int y2 = Integer.parseInt(st.nextToken());
+            
+            int count = 0;
+            
+            for (int k = 1; k <= 10; k++) {
+                int result = sum[k][x2][y2] - sum[k][x1-1][y2] - sum[k][x2][y1-1] + sum[k][x1-1][y1-1];
+                
+                if (result > 0) count++;
+            }
+            
+            bw.write(count + "\n");
+        }
+        bw.close();
+    }
+}
+```