diff --git "a/src/main/kotlin/byeonghee/week67/\352\262\214\353\246\254\353\247\250\353\215\224\353\247\201.kt" "b/src/main/kotlin/byeonghee/week67/\352\262\214\353\246\254\353\247\250\353\215\224\353\247\201.kt"
new file mode 100644
index 00000000..361575a8
--- /dev/null
+++ "b/src/main/kotlin/byeonghee/week67/\352\262\214\353\246\254\353\247\250\353\215\224\353\247\201.kt"
@@ -0,0 +1,75 @@
+package byeonghee.week67
+
+import kotlin.math.abs
+
+class 소병희_게리맨더링 {
+    companion object {
+        fun solve() = with(System.`in`.bufferedReader()) {
+            val n = readLine().toInt()
+            val popul = IntArray(n)
+            var sum = 0
+            var answer = 0
+
+            readLine().split(" ").forEachIndexed { i, v ->
+                popul[i] = v.toInt().also { sum += it }
+            }
+
+            val adjList = Array(n) { ArrayDeque<Int>() }
+
+            repeat(n) { i ->
+                readLine().split(" ").drop(1).forEach { j ->
+                    adjList[i].add(j.toInt() - 1)
+                }
+            }
+
+            fun checkAdj(visited: IntArray): Boolean {
+                val q = ArrayDeque<Int>()
+                val nxt = visited.indexOfFirst { it != 0 }
+                if (nxt == -1) return false
+
+                q.add(nxt)
+                visited[nxt] = 1
+
+                while(q.isNotEmpty()) {
+                    val top = q.removeFirst()
+                    for(i in adjList[top]) {
+                        if (visited[i] == 0 || visited[i] == 1) continue
+                        q.add(i)
+                        visited[i] = 1
+                    }
+                }
+
+                return visited.all { it == 0 || it == 1 }
+            }
+
+            fun dfs(cur: Int, visited: IntArray, part: Int) {
+                if (answer > abs(sum - 2 * part)) {
+                    if (checkAdj(visited.clone())) {
+                        answer = abs(sum - 2 * part)
+                    }
+                }
+
+                for(nxt in adjList[cur]) {
+                    if (visited[nxt] == visited[cur]) continue
+
+                    var tmp = visited[nxt]
+                    visited[nxt] = visited[cur]
+                    dfs(nxt, visited, part + popul[nxt])
+                    visited[nxt] = tmp
+                }
+            }
+
+            answer = sum
+            val visited = IntArray(n) { it }
+            dfs(0, visited, popul[0])
+
+            if (answer == sum) println(-1)
+            else println(answer)
+        }
+
+    }
+}
+
+fun main() {
+    소병희_게리맨더링.solve()
+}
diff --git "a/src/main/kotlin/byeonghee/week67/\355\205\214\354\235\264\353\270\224 \355\225\264\354\213\234 \355\225\250\354\210\230.kt" "b/src/main/kotlin/byeonghee/week67/\355\205\214\354\235\264\353\270\224 \355\225\264\354\213\234 \355\225\250\354\210\230.kt"
new file mode 100644
index 00000000..521152a5
--- /dev/null
+++ "b/src/main/kotlin/byeonghee/week67/\355\205\214\354\235\264\353\270\224 \355\225\264\354\213\234 \355\225\250\354\210\230.kt"	
@@ -0,0 +1,20 @@
+package byeonghee.week67
+
+class 소병희_테이블해시함수 {
+    fun solution(data: Array<IntArray>, col: Int, row_begin: Int, row_end: Int): Int {
+        var answer = 0
+
+        data.sortWith(compareBy<IntArray> { it[col-1] }.thenByDescending { it[0] })
+
+        for(i in row_begin .. row_end) {
+            var si = 0
+            for(num in data[i-1]) {
+                si += num % i
+            }
+
+            answer = answer xor si
+        }
+
+        return answer
+    }
+}
\ No newline at end of file