[D2] Title: 어디에 단어가 들어갈 수 있을까, Time: 78 ms, Memory: 24,704 KB -BaekjoonHub

Author: SHIMHUN

SWEA/D2/1979. 어디에 단어가 들어갈 수 있을까/README.md

@@ -0,0 +1,15 @@
+# [D2] 어디에 단어가 들어갈 수 있을까 - 1979 
+
+[문제 링크](https://swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV5PuPq6AaQDFAUq) 
+
+### 성능 요약
+
+메모리: 24,704 KB, 시간: 78 ms, 코드길이: 1,813 Bytes
+
+### 제출 일자
+
+2025-10-06 17:10
+
+
+
+> 출처: SW Expert Academy, https://swexpertacademy.com/main/code/problem/problemList.do

SWEA/D2/1979. 어디에 단어가 들어갈 수 있을까/어디에 단어가 들어갈 수 있을까.java

@@ -0,0 +1,56 @@
+import java.util.*;
+import java.io.*;
+
+class Solution {
+    public static void main(String args[]) throws Exception {
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        StringBuilder sb = new StringBuilder();
+        int T = Integer.parseInt(br.readLine());
+
+        for (int t = 1; t <= T; t++) {
+            StringTokenizer st = new StringTokenizer(br.readLine());
+            int N = Integer.parseInt(st.nextToken());
+            int K = 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 count = 0;
+
+            // 가로 검사
+            for (int i = 0; i < N; i++) {
+                int consecutive = 0;
+                for (int j = 0; j < N; j++) {
+                    if (arr[i][j] == 1) consecutive++;
+                    else {
+                        if (consecutive == K) count++;
+                        consecutive = 0;
+                    }
+                }
+                if (consecutive == K) count++;
+            }
+
+            // 세로 검사
+            for (int j = 0; j < N; j++) {
+                int consecutive = 0;
+                for (int i = 0; i < N; i++) {
+                    if (arr[i][j] == 1) consecutive++;
+                    else {
+                        if (consecutive == K) count++;
+                        consecutive = 0;
+                    }
+                }
+                if (consecutive == K) count++;
+            }
+
+            sb.append("#").append(t).append(" ").append(count).append("\n");
+        }
+
+        System.out.print(sb);
+    }
+}