Merge pull request #186 from AlgoLeadMe/23-SeongHoonC

23-SeongHoonC

SeongHoonC/README.md

@@ -23,5 +23,6 @@
 | 19차시 | 2024.04.04 | 그리디 | <a href="https://www.acmicpc.net/problem/16496">큰 수 만들기</a> |https://github.com/AlgoLeadMe/AlgoLeadMe-6/pull/72 |
 | 20차시 | 2024.04.07 | DP | <a href="https://www.acmicpc.net/problem/7579">앱</a> |https://github.com/AlgoLeadMe/AlgoLeadMe-6/pull/75 |
 | 21차시 | 2024.04.11 | DP | <a href="https://www.acmicpc.net/problem/1149">RGB거리</a> |https://github.com/AlgoLeadMe/AlgoLeadMe-6/pull/77 |
-| 21차시 | 2024.05.01 | DP | <a href="https://www.acmicpc.net/problem/11053">가장 긴 증가하는 부분 수열</a> |https://github.com/AlgoLeadMe/AlgoLeadMe-6/pull/80 |
+| 22차시 | 2024.05.01 | DP | <a href="https://www.acmicpc.net/problem/11053">가장 긴 증가하는 부분 수열</a> |https://github.com/AlgoLeadMe/AlgoLeadMe-6/pull/80 |
+| 23차시 | 2024.05.14 | ??? | <a href="https://www.acmicpc.net/problem/1644">소수의 연속합</a> |https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/186 |
 ---

SeongHoonC/누적합/23-소수의연속합.kt

@@ -0,0 +1,39 @@
+import java.io.BufferedReader
+import java.io.InputStreamReader
+import kotlin.math.sqrt
+
+fun main() {
+    val br = BufferedReader(InputStreamReader(System.`in`))
+    var (head, tail) = 0 to 0
+    val n = br.readLine().toInt()
+    val primes = findPrimeNumbers(n)
+    var count = 0
+
+    while (head < primes.size && tail < primes.size) {
+        val sum = primes.subList(head, tail + 1).sum()
+        if (sum < n) {
+            tail++
+            continue
+        }
+        if (sum == n) {
+            count++
+        }
+        head++
+    }
+    println(count)
+}
+
+private fun findPrimeNumbers(rangeMax: Int): List<Int> {
+    return (2..rangeMax).filter {
+        isPrime(it)
+    }
+}
+
+private fun isPrime(num: Int): Boolean {
+    for (i in 2..sqrt(num.toDouble()).toInt()) {
+        if (num % i == 0) {
+            return false
+        }
+    }
+    return true
+}