[D2] Title: 파리 퇴치, Time: 79 ms, Memory: 25,088 KB -BaekjoonHub

Author: ghi512

SWEA/D2/2001. 파리 퇴치/README.md

@@ -0,0 +1,15 @@
+# [D2] 파리 퇴치 - 2001 
+
+[문제 링크](https://swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV5PzOCKAigDFAUq) 
+
+### 성능 요약
+
+메모리: 25,088 KB, 시간: 79 ms, 코드길이: 1,302 Bytes
+
+### 제출 일자
+
+2025-11-18 16:45
+
+
+
+> 출처: SW Expert Academy, https://swexpertacademy.com/main/code/problem/problemList.do

SWEA/D2/2001. 파리 퇴치/파리 퇴치.java

@@ -0,0 +1,39 @@
+import java.util.*;
+import java.io.*;
+
+class Solution {
+	public static void main(String args[]) throws Exception {
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        int T = Integer.parseInt(br.readLine());
+
+		for(int test_case = 1; test_case <= T; test_case++) {
+            StringTokenizer st = new StringTokenizer(br.readLine(), " ");
+            int n = Integer.parseInt(st.nextToken());
+            int m = Integer.parseInt(st.nextToken());
+            int[][] arr = new int[n][n];
+            
+            for(int i=0; i<n; i++) {
+                st = new StringTokenizer(br.readLine(), " ");
+                for(int j=0; j<n; j++) {
+                    arr[i][j] = Integer.parseInt(st.nextToken());
+                }
+            }
+            
+            int answer = 0;
+            for(int i=0; i<(n-m+1); i++) {
+                for(int j=0; j<(n-m+1); j++) {
+                    int sum = 0;
+                    for(int k=i; k<i+m; k++) {
+                        for(int l=j; l<j+m; l++) {
+                            sum += arr[k][l];
+                        }
+                    }
+                    if(sum>answer) answer = sum;
+                }
+            }
+            
+            System.out.println("#" + test_case + " " + answer);
+		
+		}
+	}
+}