fix : packaging 오류 해결

Author: murjune

build/classes/kotlin/main/META-INF/AlgorithmStudy.kotlin_module

@@ -0,0 +1,2 @@
+119
+0

build/kotlin/compileKotlin/cacheable/caches-jvm/inputs/source-to-output.tab

@@ -0,0 +1 @@
+ƃ
�D

build/kotlin/compileKotlin/cacheable/caches-jvm/inputs/source-to-output.tab.keystream

@@ -1,12 +1,12 @@
 package baekjun
 
-val br = System.`in`.bufferedReader()
-var n = 0
+private val br = System.`in`.bufferedReader()
+private var n = 0
 lateinit var str: List<String>
-var ans = Int.MIN_VALUE
+private var ans = Int.MIN_VALUE
 fun main() {
-    n = baekjun.tree.`4803`.br.readLine().toInt()
-    str = baekjun.tree.`4803`.br.readLine().toList().map { it.toString() }
+    n = br.readLine().toInt()
+    str = br.readLine().toList().map { it.toString() }
     val stack = listOf<String>(str[0])
     bf(1, stack)
     println(ans)

build/kotlin/compileKotlin/cacheable/caches-jvm/inputs/source-to-output.tab.keystream.len

@@ -1,19 +1,20 @@
+package baekjun.backtracking
 import java.io.BufferedReader
 import java.io.BufferedWriter
 import java.io.InputStreamReader
 import java.io.OutputStreamWriter
 
 //  단순할 확률을 출력
 // 절대/상대 오차는 10-9
-val br = BufferedReader(InputStreamReader(System.`in`))
-val bw = BufferedWriter(OutputStreamWriter(System.out))
+private val br = BufferedReader(InputStreamReader(System.`in`))
+private val bw = BufferedWriter(OutputStreamWriter(System.out))
 lateinit var visited: MutableList<BooleanArray>
-val dx = listOf(0, 0, 1, -1)
-val dy = listOf(1, -1, 0, 0)
-var ans: Double = 0.0
+private val dx = listOf(0, 0, 1, -1)
+private val dy = listOf(1, -1, 0, 0)
+private var ans: Double = 0.0
 lateinit var percentageList: List<Double>
 fun main() {
-    val (n, E, W, N, S) = baekjun.tree.`4803`.br.readLine().split(" ").map { it.toInt() }
+    val (n, E, W, N, S) = br.readLine().split(" ").map { it.toInt() }
     percentageList = listOf(E * 0.01, W * 0.01, N * 0.01, S * 0.01)
     visited= mutableListOf<BooleanArray>().apply {
         repeat(29) {
@@ -22,15 +23,15 @@ fun main() {
     }
     visited[14][14] = true
     backTracking(n, 14, 14, 0, 1.0)
-    bw.write("${baekjun.ans}\n")
+    bw.write("${ans}\n")
     bw.flush()
     bw.close()
-    baekjun.tree.`4803`.br.close()
+    br.close()
 }
 
 fun backTracking(n: Int, x: Int, y: Int, cnt: Int, result: Double) {
     if (cnt == n) {
-        baekjun.ans += result
+        ans += result
         return
     }
 

build/kotlin/compileKotlin/cacheable/caches-jvm/inputs/source-to-output.tab.len

@@ -1,30 +1,32 @@
+package baekjun.backtracking.`9663-n-queen`
+
 import java.io.BufferedReader
 import java.io.BufferedWriter
 import java.io.InputStreamReader
 import java.io.OutputStreamWriter
 import kotlin.math.abs
 
-val br = BufferedReader(InputStreamReader(System.`in`))
-val bw = BufferedWriter(OutputStreamWriter(System.out))
-val n = baekjun.tree.`4803`.br.readLine().toInt()
-val graph = IntArray(baekjun.n)
-var ans = 0
+private val br = BufferedReader(InputStreamReader(System.`in`))
+private val bw = BufferedWriter(OutputStreamWriter(System.out))
+private val n = br.readLine().toInt()
+private val graph = IntArray(n)
+private var ans = 0
 fun main() {
     searchQueen(0)
-    bw.write("${baekjun.ans}\n")
+    bw.write("${ans}\n")
     bw.flush()
     bw.close()
-    baekjun.tree.`4803`.br.close()
+    br.close()
 
 }
 
 private fun searchQueen(y: Int) {
-    if (y == baekjun.n) {
-        baekjun.ans++
+    if (y == n) {
+        ans++
         return
     }
 
-    for (x in 0 until baekjun.n) {
+    for (x in 0 until n) {
         if (isPossible(x, y)) {
             graph[y] = x
             searchQueen(y + 1) // 다음 y축에서 퀸 찾기 

build/kotlin/compileKotlin/cacheable/caches-jvm/inputs/source-to-output.tab.values.at

@@ -1,3 +1,4 @@
+package baekjun.`binary-search`
 import java.io.BufferedReader
 import java.io.BufferedWriter
 import java.io.InputStreamReader
@@ -18,8 +19,8 @@ import java.io.OutputStreamWriter
 private val br = BufferedReader(InputStreamReader(System.`in`))
 private val bw = BufferedWriter(OutputStreamWriter(System.out))
 fun main() {
-    val (_, m) = baekjun.tree.`4803`.br.readLine().split(" ").map { it.toInt() }
-    val nums = baekjun.tree.`4803`.br.readLine().split(" ").map { it.toInt() }
+    val (_, m) = br.readLine().split(" ").map { it.toInt() }
+    val nums = br.readLine().split(" ").map { it.toInt() }
     var ans = 10_000
     var (s, e) = listOf(0, 10_001)
     // 파라매트릭스 문제
@@ -34,7 +35,7 @@ fun main() {
     }
     bw.write("$ans")
     bw.flush()
-    baekjun.tree.`4803`.br.close()
+    br.close()
     bw.close()
 }
 

build/kotlin/compileKotlin/cacheable/caches-jvm/inputs/source-to-output.tab_i

@@ -1,19 +1,18 @@
-package algo
+package baekjun.`binary-search`.`1654-랜선 자르기`
 
 import java.io.BufferedReader
 import java.io.BufferedWriter
 import java.io.InputStreamReader
 import java.io.OutputStreamWriter
-import java.util.*
 import kotlin.math.max
 
 // 각 랜선 길이 2^31 -1 이하
 // 총 랜선 개수 <= 10_000
 // 필요한 랜선 개수 <= 1_000_000 -> Long 가능
-val br = BufferedReader(InputStreamReader(System.`in`))
-val bw = BufferedWriter(OutputStreamWriter(System.out))
-val arr = LongArray(10_000)
-var ans = 0L
+private val br = BufferedReader(InputStreamReader(System.`in`))
+private val bw = BufferedWriter(OutputStreamWriter(System.out))
+private val arr = LongArray(10_000)
+private var ans = 0L
 fun main() {
     val (k, n) = br.readLine().split(" ").map { it.toInt() }
     repeat(k) { i ->

build/kotlin/compileKotlin/cacheable/caches-jvm/inputs/source-to-output.tab_i.len

@@ -1,8 +1,10 @@
+package baekjun.`binary-search`
 import kotlin.math.*
+
 private val br = System.`in`.bufferedReader()
 fun main() {
     // 2 * 1e9
-    val (a, b) = baekjun.tree.`4803`.br.readLine().split(" ").map{it.toInt()}
+    val (a, b) = br.readLine().split(" ").map{it.toInt()}
     val target = b - a
     // 2147483647
     // 이분 탐색

build/kotlin/compileKotlin/cacheable/caches-jvm/jvm/kotlin/class-attributes.tab

@@ -1,3 +1,4 @@
+package baekjun.`binary-search`
 fun main() {
     val br = System.`in`.bufferedReader()
     val (_, m) = br.readLine().split(" ").map{it.toInt()}

build/kotlin/compileKotlin/cacheable/caches-jvm/jvm/kotlin/class-attributes.tab.keystream

@@ -1,4 +1,4 @@
-package algorithm
+package baekjun.`binary-search`.`2805-나무 자르기`
 
 import java.io.BufferedReader
 import java.io.BufferedWriter
@@ -9,9 +9,9 @@ import kotlin.math.max
 // (1 ≤ N ≤ 1,000,000, 1 ≤ M ≤ 2,000,000,000)
 // Long 가능, BigInteger 안써도 됨~
 // 필요한 나무의 높이는 1,000,000,000보다 작거나 같은 양의 정수 또는 0이다.
-val br = BufferedReader(InputStreamReader(System.`in`))
-val bw = BufferedWriter(OutputStreamWriter(System.out))
-const val MAX_HEIGHT = 2_000_000_000L
+private val br = BufferedReader(InputStreamReader(System.`in`))
+private val bw = BufferedWriter(OutputStreamWriter(System.out))
+private const val MAX_HEIGHT = 2_000_000_000L
 fun main() {
     val (_, m) = br.readLine().split(" ").map { it.toLong() }
     val trees = br.readLine().split(" ").map { it.toLong() }

build/kotlin/compileKotlin/cacheable/caches-jvm/jvm/kotlin/class-attributes.tab.keystream.len

@@ -1,18 +1,19 @@
+package baekjun.bruteforce.`1010 - 다리놓기`
 import java.io.BufferedReader
 import java.io.BufferedWriter
 import java.io.InputStreamReader
 import java.io.OutputStreamWriter
 import java.math.BigInteger
 
-val br = BufferedReader(InputStreamReader(System.`in`))
-val bw = BufferedWriter(OutputStreamWriter(System.out))
+private val br = BufferedReader(InputStreamReader(System.`in`))
+private val bw = BufferedWriter(OutputStreamWriter(System.out))
 fun main() {
-    repeat(baekjun.tree.`4803`.br.readLine().toInt()) {
-        val (m, n) = baekjun.tree.`4803`.br.readLine().split(" ").map { it.toInt() }
+    repeat(br.readLine().toInt()) {
+        val (m, n) = br.readLine().split(" ").map { it.toInt() }
         bw.write("${combination(n, m)}\n")
         bw.flush()
     }
-    baekjun.tree.`4803`.br.close()
+    br.close()
     bw.close()
 }
 

build/kotlin/compileKotlin/cacheable/caches-jvm/jvm/kotlin/class-attributes.tab.len

@@ -1,18 +1,19 @@
+package baekjun.bruteforce.`1010 - 다리놓기`
 import java.io.BufferedReader
 import java.io.BufferedWriter
 import java.io.InputStreamReader
 import java.io.OutputStreamWriter
 import java.math.BigInteger
 
-val br = BufferedReader(InputStreamReader(System.`in`))
-val bw = BufferedWriter(OutputStreamWriter(System.out))
+private val br = BufferedReader(InputStreamReader(System.`in`))
+private val bw = BufferedWriter(OutputStreamWriter(System.out))
 fun main() {
-    repeat(baekjun.tree.`4803`.br.readLine().toInt()) {
-        val (m, n) = baekjun.tree.`4803`.br.readLine().split(" ").map { it.toInt() }
+    repeat(br.readLine().toInt()) {
+        val (m, n) = br.readLine().split(" ").map { it.toInt() }
         bw.write("${combination(n, m)}\n")
         bw.flush()
     }
-    baekjun.tree.`4803`.br.close()
+    br.close()
     bw.close()
 }
 

build/kotlin/compileKotlin/cacheable/caches-jvm/jvm/kotlin/class-attributes.tab.values.at

@@ -1,31 +1,29 @@
-package algorithm
+package baekjun.bruteforce
 
 import java.io.BufferedReader
 import java.io.BufferedWriter
 import java.io.InputStreamReader
 import java.io.OutputStreamWriter
-import java.util.Collections
-import kotlin.math.max
 import kotlin.math.min
 
 // 시간 복잡도 O(M- 8 * N -8 * 8^2)
-val br = BufferedReader(InputStreamReader(System.`in`))
-val bw = BufferedWriter(OutputStreamWriter(System.out))
+private val br = BufferedReader(InputStreamReader(System.`in`))
+private val bw = BufferedWriter(OutputStreamWriter(System.out))
 
-var board: MutableList<List<Char>> = mutableListOf()
-var chessBoardWhenStartWhite: MutableList<CharArray> = mutableListOf<CharArray>().apply {
+private var board: MutableList<List<Char>> = mutableListOf()
+private var chessBoardWhenStartWhite: MutableList<CharArray> = mutableListOf<CharArray>().apply {
     repeat(8){
         add(CharArray(8))
     }
 }
-var chessBoardWhenStartBlack: MutableList<CharArray> = mutableListOf<CharArray>().apply {
+private var chessBoardWhenStartBlack: MutableList<CharArray> = mutableListOf<CharArray>().apply {
     repeat(8){
         add(CharArray(8))
     }
 }
-const val BLACK = 'B'
-const val WHITE = 'W'
-var ans = 2501
+private const val BLACK = 'B'
+private const val WHITE = 'W'
+private var ans = 2501
 fun main() {
     val (n, m) = br.readLine().split(" ").map {
         it.toInt()

build/kotlin/compileKotlin/cacheable/caches-jvm/jvm/kotlin/class-attributes.tab_i

@@ -1,4 +1,4 @@
-package org.techtown.practice_mvvm_event.algorithm
+package baekjun.bruteforce
 
 import java.io.BufferedReader
 import java.io.BufferedWriter
@@ -13,14 +13,14 @@ import kotlin.math.max
 //   DisJoint-Set 문제인가?? X O(baekjun.getN^3)
 // 그럼 일단 브루트포스로 풀자!
 // A-B-C D
-val br = BufferedReader(InputStreamReader(System.`in`))
-val bw = BufferedWriter(OutputStreamWriter(System.out))
-val graph = mutableListOf<MutableList<Int>>().apply {
+private val br = BufferedReader(InputStreamReader(System.`in`))
+private val bw = BufferedWriter(OutputStreamWriter(System.out))
+private val graph = mutableListOf<MutableList<Int>>().apply {
     repeat(50) {
         add(mutableListOf())
     }
 }
-var ans = 0
+private var ans = 0
 fun main() {
     val n = br.readLine().toInt()
     repeat(n) { i ->

build/kotlin/compileKotlin/cacheable/caches-jvm/jvm/kotlin/class-attributes.tab_i.len

@@ -1,4 +1,4 @@
-package org.techtown.practice_mvvm_event.algorithm
+package baekjun.bruteforce.`1107-리모컨 `
 
 import java.io.BufferedReader
 import java.io.BufferedWriter
@@ -9,8 +9,8 @@ import kotlin.math.min
 
 // N (0 ≤ N ≤ 500,000)이 주어진다.
 // 고장난 버튼의 개수 M (0 ≤ M ≤ 10)
-val br = BufferedReader(InputStreamReader(System.`in`))
-val bw = BufferedWriter(OutputStreamWriter(System.out))
+private val br = BufferedReader(InputStreamReader(System.`in`))
+private val bw = BufferedWriter(OutputStreamWriter(System.out))
 
 private var targetChannelNum = 0
 private const val START_NUM = 100

build/kotlin/compileKotlin/cacheable/caches-jvm/jvm/kotlin/class-fq-name-to-source.tab

@@ -1,4 +1,4 @@
-package org.techtown.practice_mvvm_event.algorithm
+package baekjun.bruteforce.`1107-리모컨 `
 
 import java.io.BufferedReader
 import java.io.BufferedWriter
@@ -9,8 +9,8 @@ import kotlin.math.min
 
 // N (0 ≤ N ≤ 500,000)이 주어진다.
 // 고장난 버튼의 개수 M (0 ≤ M ≤ 10)
-val br = BufferedReader(InputStreamReader(System.`in`))
-val bw = BufferedWriter(OutputStreamWriter(System.out))
+private val br = BufferedReader(InputStreamReader(System.`in`))
+private val bw = BufferedWriter(OutputStreamWriter(System.out))
 
 private var targetChannelNum = 0
 private const val START_NUM = 100

build/kotlin/compileKotlin/cacheable/caches-jvm/jvm/kotlin/class-fq-name-to-source.tab.keystream

@@ -1,4 +1,4 @@
-package org.techtown.practice_mvvm_event.algorithm
+package baekjun.bruteforce.`1107-리모컨 `
 
 import java.io.BufferedReader
 import java.io.BufferedWriter
@@ -9,8 +9,8 @@ import kotlin.math.min
 
 // N (0 ≤ N ≤ 500,000)이 주어진다.
 // 고장난 버튼의 개수 M (0 ≤ M ≤ 10)
-val br = BufferedReader(InputStreamReader(System.`in`))
-val bw = BufferedWriter(OutputStreamWriter(System.out))
+private val br = BufferedReader(InputStreamReader(System.`in`))
+private val bw = BufferedWriter(OutputStreamWriter(System.out))
 
 private var targetChannelNum = 0
 private const val START_NUM = 100

build/kotlin/compileKotlin/cacheable/caches-jvm/jvm/kotlin/class-fq-name-to-source.tab.keystream.len

@@ -1,15 +1,17 @@
+package baekjun.bruteforce.`1157_단어공부`
+
 import java.io.BufferedReader
 import java.io.BufferedWriter
 import java.io.InputStreamReader
 import java.io.OutputStreamWriter
 
 // O(N)
 // 뭔가 좀 더 간결화할 수 있을 것 같긴 한데...
-val br = BufferedReader(InputStreamReader(System.`in`))
-val bw = BufferedWriter(OutputStreamWriter(System.out))
+private val br = BufferedReader(InputStreamReader(System.`in`))
+private val bw = BufferedWriter(OutputStreamWriter(System.out))
 
 fun main() {
-    val str = baekjun.tree.`4803`.br.readLine()
+    val str = br.readLine()
     var ans = ""
     var maxAlphabetCnt = 0
     val pivot: Int?
@@ -32,6 +34,6 @@ fun main() {
     }
     if (maxAlphabetCnt == 1) bw.write(ans) else bw.write("?")
     bw.flush()
-    baekjun.tree.`4803`.br.close()
+    br.close()
     bw.close()
 }