From aeaf2866bc099ba97c3e9e026172cdfdfa56defc Mon Sep 17 00:00:00 2001
From: qbobl5 <113408131+qbobl5@users.noreply.github.com>
Date: Mon, 12 May 2025 21:54:06 +0900
Subject: [PATCH] =?UTF-8?q?[250512]=20B10830=20=ED=96=89=EB=A0=AC=20?=
 =?UTF-8?q?=EC=A0=9C=EA=B3=B1?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 qbobl5/week16/B10830.java | 53 +++++++++++++++++++++++++++++++++++++++
 1 file changed, 53 insertions(+)
 create mode 100644 qbobl5/week16/B10830.java

diff --git a/qbobl5/week16/B10830.java b/qbobl5/week16/B10830.java
new file mode 100644
index 0000000..c2c5584
--- /dev/null
+++ b/qbobl5/week16/B10830.java
@@ -0,0 +1,53 @@
+import java.io.*;
+import java.util.*;
+
+public class B10830 {
+    static int[][] matrix;
+    static int N;
+
+    public static void main(String[] args) throws IOException {
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        StringTokenizer st = new StringTokenizer(br.readLine());
+        
+        N = Integer.parseInt(st.nextToken());
+        long B = Long.parseLong(st.nextToken());
+        matrix = new int[N][N];
+
+        for(int i=0; i<N; i++) {
+            st = new StringTokenizer(br.readLine());
+            for(int j=0; j<N; j++) matrix[i][j] = Integer.parseInt(st.nextToken()) % 1000;
+        }
+
+        int[][] result = pow(matrix, B);
+        StringBuilder sb = new StringBuilder();
+        
+        for(int i=0; i<N; i++) {
+            for(int j=0; j<N; j++) sb.append(result[i][j]).append(" ");
+            sb.append("\n");
+        }
+        
+        System.out.println(sb);
+    }
+
+    static int[][] pow(int[][] matrix, long B) {
+        if(B == 1L) return matrix;
+        int[][] temp = pow(matrix, B / 2);
+        if(B % 2 == 0) return multiply(temp, temp);
+        else return multiply(multiply(temp, temp), matrix);
+    }
+
+    static int[][] multiply(int[][] arr1, int[][] arr2) {
+        int[][] result = new int[N][N];
+
+        for(int i=0; i<N; i++) {
+            for(int j=0; j<N; j++) {
+                for(int k=0; k<N; k++) {
+                    result[i][j] += arr1[i][k] * arr2[k][j];
+                    result[i][j] %= 1000;
+                }
+            }
+        }
+
+        return result;
+    }
+}