Use Int.pow() implementation where potentials of Int are calculated

This avoids type conversion to Double and makes the code a
bit more readable.

Author: rhaendel

src/main/kotlin/de/ronny_h/aoc/extensions/Combinations.kt

@@ -1,6 +1,6 @@
 package de.ronny_h.aoc.extensions
 
-import kotlin.math.pow
+import de.ronny_h.aoc.extensions.numbers.pow
 
 
 /**
@@ -46,7 +46,7 @@ fun <E> permutationsOf(list: List<E>): Sequence<List<E>> = sequence {
 fun <E> allSublistsOf(list: List<E>): Sequence<List<E>> = sequence {
     // count a binary number with list.size digits from 0...0 to 1...1
     var number = 0
-    while (number < 2.0.pow(list.size.toDouble())) {
+    while (number < 2.pow(list.size)) {
         val sublist = ArrayList<E>(list.size)
         val binary = number.toString(2).reversed()
         // take the list elements at indices of the 1 bits

src/main/kotlin/de/ronny_h/aoc/year2015/day17/NoSuchThingAsTooMuch.kt

@@ -3,7 +3,7 @@ package de.ronny_h.aoc.year2015.day17
 import de.ronny_h.aoc.AdventOfCode
 import de.ronny_h.aoc.extensions.allSublistsOf
 
-fun main() = NoSuchThingAsTooMuch().run(654, 0)
+fun main() = NoSuchThingAsTooMuch().run(654, 57)
 
 class NoSuchThingAsTooMuch : AdventOfCode<Int>(2015, 17) {
     override fun part1(input: List<String>): Int =

src/main/kotlin/de/ronny_h/aoc/year2024/day07/BridgeRepair.kt

@@ -1,7 +1,7 @@
 package de.ronny_h.aoc.year2024.day07
 
 import de.ronny_h.aoc.AdventOfCode
-import kotlin.math.pow
+import de.ronny_h.aoc.extensions.numbers.pow
 
 fun main() = BridgeRepair().run(1399219271639, 275791737999003)
 
@@ -55,7 +55,7 @@ data class Equation(val result: Long, val numbers: List<Long>, var solvable: Boo
      * - `operatorIndexSequenceFor(2,3)` yields `[0,0,0,1,0,2,1,0,1,1,1,2,2,0,2,1,2,2]` (counting from 0 `00` to 9 `22`)
      */
     private fun operatorIndexSequenceFor(digits: Int, operatorCount: Int = 2) = sequence {
-        for (count in 0..<(operatorCount.toDouble().pow(digits).toInt())) {
+        for (count in 0..<operatorCount.pow(digits)) {
             val binary = count.toString(operatorCount).fillLeadingZeros(digits)
             for (i in 0..<digits) {
                 yield(binary[i].digitToInt())

src/main/kotlin/de/ronny_h/aoc/year2024/day11/PlutonianPebbles.kt

@@ -1,8 +1,9 @@
 package de.ronny_h.aoc.year2024.day11
 
 import de.ronny_h.aoc.AdventOfCode
-import de.ronny_h.aoc.extensions.numbers.digitCount
 import de.ronny_h.aoc.extensions.memoize
+import de.ronny_h.aoc.extensions.numbers.digitCount
+import de.ronny_h.aoc.extensions.numbers.pow
 
 fun main() = PlutonianPebbles().run(193899, 229682160383225)
 
@@ -13,16 +14,8 @@ class PlutonianPebbles : AdventOfCode<Long>(2024, 11) {
         .map(String::toLong)
         .toMutableList()
 
-    private fun tenToPowerOf(digitCount: Int): Int {
-        var tens = 10
-        repeat((digitCount / 2) - 1) {
-            tens *= 10
-        }
-        return tens
-    }
-
     private val cacheDigitCounts = mutableMapOf<Long, Int>()
-    private val cachePowers = IntArray(20) { tenToPowerOf(it) }
+    private val cachePowers = IntArray(20) { 10.pow(it / 2) }
 
     private fun blink(stone: Long): List<Long> {
         if (stone == 0L) {
@@ -45,7 +38,12 @@ class PlutonianPebbles : AdventOfCode<Long>(2024, 11) {
             if (state.height == 0) {
                 state.stones.size.toLong()
             } else if (state.stones.size > 1) {
-                blinkRec(State(state.height, state.stones.subList(0, state.stones.size/2))) + blinkRec(State(state.height, state.stones.subList(state.stones.size/2, state.stones.size)))
+                blinkRec(
+                    State(
+                        state.height,
+                        state.stones.subList(0, state.stones.size / 2)
+                    )
+                ) + blinkRec(State(state.height, state.stones.subList(state.stones.size / 2, state.stones.size)))
             } else {
                 blinkRec(State(state.height - 1, blink(state.stones.single())))
             }