kt_path stringlengths 35 167 | kt_source stringlengths 626 28.9k | classes listlengths 1 17 |
|---|---|---|
n81ur3__kotlin-coding-challenges__fdc5941/src/main/kotlin/adventofcode2018/Day18SettlersOfTheNorthPole.kt | package adventofcode2018
import adventofcode2018.AreaElement.*
import java.lang.Math.min
import java.util.*
import kotlin.math.max
class Day18SettlersOfTheNorthPole
sealed class AreaElement(val sign: Char) {
object Open : AreaElement('.')
object Tree : AreaElement('|')
object Lumberyard : AreaElement('#'... | [
{
"class_path": "n81ur3__kotlin-coding-challenges__fdc5941/adventofcode2018/Day18SettlersOfTheNorthPoleKt.class",
"javap": "Compiled from \"Day18SettlersOfTheNorthPole.kt\"\npublic final class adventofcode2018.Day18SettlersOfTheNorthPoleKt {\n public static final int hash(java.util.List<? extends java.util... |
n81ur3__kotlin-coding-challenges__fdc5941/src/main/kotlin/adventofcode2018/Day04ReposeRecord.kt | package adventofcode2018
import java.time.LocalDateTime
import java.time.format.DateTimeFormatter
class Day04ReposeRecord
data class Guard(val id: Int)
data class SleepPeriod(val start: LocalDateTime, val stop: LocalDateTime)
sealed class ShiftEntry(
val dateTime: LocalDateTime,
val guard: Guard = Guard(-1... | [
{
"class_path": "n81ur3__kotlin-coding-challenges__fdc5941/adventofcode2018/Day04ReposeRecord.class",
"javap": "Compiled from \"Day04ReposeRecord.kt\"\npublic final class adventofcode2018.Day04ReposeRecord {\n public adventofcode2018.Day04ReposeRecord();\n Code:\n 0: aload_0\n 1: invokespeci... |
n81ur3__kotlin-coding-challenges__fdc5941/src/main/kotlin/adventofcode2018/Day06ChronalCoordinates.kt | package adventofcode2018
class Day06ChronalCoordinates
data class Coordinate(val id: Int, val x: Int, val y: Int) {
fun manhattanDistance(fromX: Int, fromY: Int): Int {
val xDist = if (fromX > x) (fromX - x) else (x - fromX)
val yDist = if (fromY > y) (fromY - y) else (y - fromY)
return x... | [
{
"class_path": "n81ur3__kotlin-coding-challenges__fdc5941/adventofcode2018/Day06ChronalCoordinates.class",
"javap": "Compiled from \"Day06ChronalCoordinates.kt\"\npublic final class adventofcode2018.Day06ChronalCoordinates {\n public adventofcode2018.Day06ChronalCoordinates();\n Code:\n 0: aload_... |
n81ur3__kotlin-coding-challenges__fdc5941/src/main/kotlin/adventofcode2018/Day23ExperimentalEmergencyTeleportation.kt | package adventofcode2018
import kotlin.math.abs
class Day23ExperimentalEmergencyTeleportation
data class TeleportCoordinate(val x: Int, val y: Int, val z: Int)
data class Nanobot(val x: Int, val y: Int, val z: Int, val radius: Int) {
fun inRange(otherBot: Nanobot): Boolean {
val manhattanDistance = dis... | [
{
"class_path": "n81ur3__kotlin-coding-challenges__fdc5941/adventofcode2018/Day23ExperimentalEmergencyTeleportation.class",
"javap": "Compiled from \"Day23ExperimentalEmergencyTeleportation.kt\"\npublic final class adventofcode2018.Day23ExperimentalEmergencyTeleportation {\n public adventofcode2018.Day23Ex... |
n81ur3__kotlin-coding-challenges__fdc5941/src/main/kotlin/adventofcode2018/Day15BeverageBandits.kt | package adventofcode2018
class Day15BeverageBandits
sealed class Token(val sign: Char, var posX: Int, var posY: Int) : Comparable<Token> {
open fun nextEnemy(): Token = NullToken()
override fun toString(): String = sign.toString()
override fun compareTo(other: Token): Int {
return when {
... | [
{
"class_path": "n81ur3__kotlin-coding-challenges__fdc5941/adventofcode2018/Day15BeverageBandits.class",
"javap": "Compiled from \"Day15BeverageBandits.kt\"\npublic final class adventofcode2018.Day15BeverageBandits {\n public adventofcode2018.Day15BeverageBandits();\n Code:\n 0: aload_0\n 1:... |
n81ur3__kotlin-coding-challenges__fdc5941/src/main/kotlin/adventofcode2018/Day22ModeMaze.kt | package adventofcode2018
class Day22ModeMaze
class MazeCalculator(val depth: Int, val targetX: Int, val targetY: Int) {
val regions: List<MutableList<Int>>
val errosionLevels: List<MutableList<Int>> = List(targetY + 1) { MutableList(targetX + 1) { 0 } }
val riskLevel: Int
get() = regions.map { lin... | [
{
"class_path": "n81ur3__kotlin-coding-challenges__fdc5941/adventofcode2018/Day22ModeMaze.class",
"javap": "Compiled from \"Day22ModeMaze.kt\"\npublic final class adventofcode2018.Day22ModeMaze {\n public adventofcode2018.Day22ModeMaze();\n Code:\n 0: aload_0\n 1: invokespecial #8 ... |
n81ur3__kotlin-coding-challenges__fdc5941/src/main/kotlin/adventofcode2018/Day12SubterraneanSustainability.kt | package adventofcode2018
class Day12SubterraneanSustainability
data class PotRule(val input: String, val result: Char) {
companion object {
fun fromString(rule: String): PotRule {
return PotRule(rule.substringBefore(" ="), rule.last())
}
}
}
class RulesSet(val rules: List<PotRule>... | [
{
"class_path": "n81ur3__kotlin-coding-challenges__fdc5941/adventofcode2018/Day12SubterraneanSustainability.class",
"javap": "Compiled from \"Day12SubterraneanSustainability.kt\"\npublic final class adventofcode2018.Day12SubterraneanSustainability {\n public adventofcode2018.Day12SubterraneanSustainability... |
n81ur3__kotlin-coding-challenges__fdc5941/src/main/kotlin/adventofcode2018/Day11ChronalCharge.kt | package adventofcode2018
class Day11ChronalCharge
data class FuelCell(val x: Int, val y: Int, val powerLevel: Int) {
companion object {
fun forSerialNumber(x: Int, y: Int, serialNumber: Int): FuelCell =
FuelCell(x, y, computePowerLevel(x, y, serialNumber))
private fun computePowerLev... | [
{
"class_path": "n81ur3__kotlin-coding-challenges__fdc5941/adventofcode2018/Day11ChronalCharge.class",
"javap": "Compiled from \"Day11ChronalCharge.kt\"\npublic final class adventofcode2018.Day11ChronalCharge {\n public adventofcode2018.Day11ChronalCharge();\n Code:\n 0: aload_0\n 1: invokes... |
n81ur3__kotlin-coding-challenges__fdc5941/src/main/kotlin/adventofcode2018/Day07TheSumOfItsParts.kt | package adventofcode2018
class Day07TheSumOfItsParts
enum class Step {
A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z
}
data class Instruction(val step: Step, val preSteps: MutableSet<Step> = mutableSetOf())
data class ConcurrentWorker(var executionTime: Int = 0, var busy: Boolean ... | [
{
"class_path": "n81ur3__kotlin-coding-challenges__fdc5941/adventofcode2018/Day07TheSumOfItsParts.class",
"javap": "Compiled from \"Day07TheSumOfItsParts.kt\"\npublic final class adventofcode2018.Day07TheSumOfItsParts {\n public adventofcode2018.Day07TheSumOfItsParts();\n Code:\n 0: aload_0\n ... |
n81ur3__kotlin-coding-challenges__fdc5941/src/main/kotlin/adventofcode2020/Day21AllergenAssessment.kt | package adventofcode2020
class Day21AllergenAssessment
data class Food(val ingredients: Set<String>, val allergens: Set<String>) {
companion object {
fun fromString(input: String): Food {
val parts = input.split(" (contains ")
val ing = parts[0].split(" ").toHashSet()
v... | [
{
"class_path": "n81ur3__kotlin-coding-challenges__fdc5941/adventofcode2020/Day21AllergenAssessment.class",
"javap": "Compiled from \"Day21AllergenAssessment.kt\"\npublic final class adventofcode2020.Day21AllergenAssessment {\n public adventofcode2020.Day21AllergenAssessment();\n Code:\n 0: aload_... |
n81ur3__kotlin-coding-challenges__fdc5941/src/main/kotlin/adventofcode2020/Day19MonsterMessage.kt | package adventofcode2020
class Day19MonsterMessage
data class MessageRule(
var ruleExpression: String = "",
) {
val fullRule: String
get() = ruleExpression
override fun toString(): String = (ruleExpression).replace(" ", "")
val isEvaluated: Boolean
get() {
val regex = "[a... | [
{
"class_path": "n81ur3__kotlin-coding-challenges__fdc5941/adventofcode2020/Day19MonsterMessage.class",
"javap": "Compiled from \"Day19MonsterMessage.kt\"\npublic final class adventofcode2020.Day19MonsterMessage {\n public adventofcode2020.Day19MonsterMessage();\n Code:\n 0: aload_0\n 1: inv... |
n81ur3__kotlin-coding-challenges__fdc5941/src/main/kotlin/adventofcode2020/Day07HandyHaversacks.kt | package adventofcode2020
class Day07HandyHaversacks
data class Bag(val type: String, val color: String, val canContain: Pair<Bag, Int>?) {
val bagName: String
get() = type + " " + color
fun containsBag(type: String, color: String, count: Int, recursive: Boolean = false): Boolean {
if (recursi... | [
{
"class_path": "n81ur3__kotlin-coding-challenges__fdc5941/adventofcode2020/Day07HandyHaversacks.class",
"javap": "Compiled from \"Day07HandyHaversacks.kt\"\npublic final class adventofcode2020.Day07HandyHaversacks {\n public adventofcode2020.Day07HandyHaversacks();\n Code:\n 0: aload_0\n 1:... |
korilin__leetcode_kt_solution__1ce05ef/src/main/kotlin/q1_50/q21_30/Solution23.kt | package q1_50.q21_30
import java.util.*
/**
* https://leetcode-cn.com/problems/merge-k-sorted-lists
*/
class Solution23 {
/**
* 优先队列
* 时间复杂度：与分治合并算法一样都是 O(kn×log(k))
*/
fun mergeKLists(lists: Array<ListNode?>): ListNode? {
val nodePriorityQueue = PriorityQueue<ListNode> { a, b -> a.`... | [
{
"class_path": "korilin__leetcode_kt_solution__1ce05ef/q1_50/q21_30/Solution23.class",
"javap": "Compiled from \"Solution23.kt\"\npublic final class q1_50.q21_30.Solution23 {\n public q1_50.q21_30.Solution23();\n Code:\n 0: aload_0\n 1: invokespecial #8 // Method java/lang/... |
korilin__leetcode_kt_solution__1ce05ef/src/main/kotlin/q1_50/q11_20/Solution18.kt | package q1_50.q11_20
import java.util.*
/**
* https://leetcode-cn.com/problems/4sum
*/
class Solution18 {
fun fourSum(nums: IntArray, target: Int): List<List<Int>> {
val result = LinkedList<List<Int>>()
if(nums.size < 4) return result
nums.sort()
val n = nums.size
for (i1... | [
{
"class_path": "korilin__leetcode_kt_solution__1ce05ef/q1_50/q11_20/Solution18.class",
"javap": "Compiled from \"Solution18.kt\"\npublic final class q1_50.q11_20.Solution18 {\n public q1_50.q11_20.Solution18();\n Code:\n 0: aload_0\n 1: invokespecial #8 // Method java/lang/... |
korilin__leetcode_kt_solution__1ce05ef/src/main/kotlin/q51_100/q61_70/Solution70.kt | package q51_100.q61_70
/**
* https://leetcode-cn.com/problems/climbing-stairs/
*/
class Solution70 {
/**
* f(x) = f(x1) + f(x2)
*
* f(x1) = 最后一步为 1 个台阶的个数 = f(x - 1)
* f(x2) = 最后一步为 2 个台阶的个数 = f(x - 2)
*
* f(x) = f(x-1) + f(x-2)
*
* 矩阵快速幂
*
* M^n * [1, 1].h = [f... | [
{
"class_path": "korilin__leetcode_kt_solution__1ce05ef/q51_100/q61_70/Solution70.class",
"javap": "Compiled from \"Solution70.kt\"\npublic final class q51_100.q61_70.Solution70 {\n public q51_100.q61_70.Solution70();\n Code:\n 0: aload_0\n 1: invokespecial #8 // Method java... |
SeanShubin__kotlin-tryme__abc67c5/domain/src/main/kotlin/com/seanshubin/kotlin/tryme/domain/dice/SpheresOfInfluenceDiceStatisticsApp.kt | package com.seanshubin.kotlin.tryme.domain.dice
object SpheresOfInfluenceDiceStatisticsApp {
fun List<Int>.incrementDieRoll(faces: Int): List<Int> {
val newValues = mutableListOf<Int>()
var carry = true
for (currentIndex in size - 1 downTo 0) {
val value = get(currentIndex)
... | [
{
"class_path": "SeanShubin__kotlin-tryme__abc67c5/com/seanshubin/kotlin/tryme/domain/dice/SpheresOfInfluenceDiceStatisticsApp.class",
"javap": "Compiled from \"SpheresOfInfluenceDiceStatisticsApp.kt\"\npublic final class com.seanshubin.kotlin.tryme.domain.dice.SpheresOfInfluenceDiceStatisticsApp {\n publi... |
SeanShubin__kotlin-tryme__abc67c5/domain/src/main/kotlin/com/seanshubin/kotlin/tryme/domain/ratio/Ratio.kt | package com.seanshubin.kotlin.tryme.domain.ratio
data class Ratio(val numerator: Int, val denominator: Int) : Comparable<Ratio> {
operator fun plus(that: Ratio): Ratio {
val lcm = leastCommonMultiple(denominator, that.denominator)
return Ratio(numerator * lcm / denominator + that.numerator * lcm / that.denom... | [
{
"class_path": "SeanShubin__kotlin-tryme__abc67c5/com/seanshubin/kotlin/tryme/domain/ratio/Ratio.class",
"javap": "Compiled from \"Ratio.kt\"\npublic final class com.seanshubin.kotlin.tryme.domain.ratio.Ratio implements java.lang.Comparable<com.seanshubin.kotlin.tryme.domain.ratio.Ratio> {\n public static... |
SeanShubin__kotlin-tryme__abc67c5/domain/src/main/kotlin/com/seanshubin/kotlin/tryme/domain/schulze/Schulze.kt | package com.seanshubin.kotlin.tryme.domain.schulze
import kotlin.math.max
import kotlin.math.min
object Schulze {
fun schulzeTally(candidates: List<String>, rows: List<List<Int>>): List<Pair<String, List<String>>> {
val strongestPaths = strongestPaths(rows)
val tallied = tally(strongestPaths, empt... | [
{
"class_path": "SeanShubin__kotlin-tryme__abc67c5/com/seanshubin/kotlin/tryme/domain/schulze/Schulze.class",
"javap": "Compiled from \"Schulze.kt\"\npublic final class com.seanshubin.kotlin.tryme.domain.schulze.Schulze {\n public static final com.seanshubin.kotlin.tryme.domain.schulze.Schulze INSTANCE;\n\... |
Asaad27__adventOfCode2022__16f0187/src/main/kotlin/asaad/DayFour.kt | package asaad
import java.io.File
private fun IntRange.containsOneAnother(intRange: IntRange): Boolean {
return this.intersect(intRange).size == minOf(intRange.size, this.size)
}
private fun IntRange.overlap(intRange: IntRange): Boolean {
return this.intersect(intRange).isNotEmpty()
}
private val IntRange.s... | [
{
"class_path": "Asaad27__adventOfCode2022__16f0187/asaad/DayFour$result$1.class",
"javap": "Compiled from \"DayFour.kt\"\nfinal class asaad.DayFour$result$1 extends kotlin.jvm.internal.FunctionReferenceImpl implements kotlin.jvm.functions.Function2<kotlin.ranges.IntRange, kotlin.ranges.IntRange, java.lang.... |
Asaad27__adventOfCode2022__16f0187/src/main/kotlin/asaad/DayThree.kt | package asaad
import java.io.File
class DayThree(filePath: String) {
private val file = File(filePath)
private val input = readInput(file)
private fun readInput(file: File) = file.readLines()
private fun Char.toPriority(): Int = when {
this.isLowerCase() -> this - 'a' + 1
this.isUppe... | [
{
"class_path": "Asaad27__adventOfCode2022__16f0187/asaad/DayThree.class",
"javap": "Compiled from \"DayThree.kt\"\npublic final class asaad.DayThree {\n private final java.io.File file;\n\n private final java.util.List<java.lang.String> input;\n\n public asaad.DayThree(java.lang.String);\n Code:\n ... |
Asaad27__adventOfCode2022__16f0187/src/main/kotlin/asaad/DayFive.kt | package asaad
import java.io.File
class DayFive(filePath: String) {
private val file = File(filePath)
private val input = readInput(file)
private fun readInput(file: File): Pair<List<String>, List<String>> {
val lines = file.readLines()
return lines.takeWhile { it.isNotBlank() } to lines... | [
{
"class_path": "Asaad27__adventOfCode2022__16f0187/asaad/DayFive$Stacks.class",
"javap": "Compiled from \"DayFive.kt\"\npublic final class asaad.DayFive$Stacks {\n private final java.util.List<java.util.List<java.lang.String>> stacks;\n\n public asaad.DayFive$Stacks(java.util.List<java.lang.String>);\n ... |
Asaad27__adventOfCode2022__16f0187/src/main/kotlin/asaad/DayTwo.kt | package asaad
import java.io.File
class DayTwo(filePath: String) {
/*
* rock -> Scissors -> paper ->rock... ->win, <-loose
*/
private val file = File(filePath)
private val input = readInput(file)
private fun readInput(file: File) = file.readLines()
private var part1 = true
priva... | [
{
"class_path": "Asaad27__adventOfCode2022__16f0187/asaad/DayTwo.class",
"javap": "Compiled from \"DayTwo.kt\"\npublic final class asaad.DayTwo {\n private final java.io.File file;\n\n private final java.util.List<java.lang.String> input;\n\n private boolean part1;\n\n private final java.util.Map<java.l... |
Asaad27__adventOfCode2022__16f0187/src/main/kotlin/asaad/DaySeven.kt | package asaad
import java.io.File
private const val MAX_STORAGE = 70000000
private const val REQUIRED_STORAGE = 30000000
private const val PART1 = 100000
class DaySeven(filePath: String) {
private val file = File(filePath)
private val input = readInput(file)
private var lineNumber = 0
private fun rea... | [
{
"class_path": "Asaad27__adventOfCode2022__16f0187/asaad/DaySeven$Command.class",
"javap": "Compiled from \"DaySeven.kt\"\npublic final class asaad.DaySeven$Command extends java.lang.Enum<asaad.DaySeven$Command> {\n public static final asaad.DaySeven$Command GOTO;\n\n public static final asaad.DaySeven$C... |
Asaad27__adventOfCode2022__16f0187/src/main/kotlin/asaad/DayNine.kt | package asaad
import java.io.File
import kotlin.math.abs
class DayNine(filePath: String) {
private val file = File(filePath)
private val input = readInput(file)
private fun readInput(file: File) = file.bufferedReader().readLines()
fun result() {
println("\tpart1: ${solve(2)}")
println... | [
{
"class_path": "Asaad27__adventOfCode2022__16f0187/asaad/DayNine.class",
"javap": "Compiled from \"DayNine.kt\"\npublic final class asaad.DayNine {\n private final java.io.File file;\n\n private final java.util.List<java.lang.String> input;\n\n public asaad.DayNine(java.lang.String);\n Code:\n ... |
MariusSchmidt__adventofcode2021__2b70993/src/main/kotlin/adventofcode/PuzzleDay04.kt | package adventofcode
import java.io.File
class PuzzleDay04 {
fun determineWinningBoardOrder(file: File): List<BingoBoard> {
val pulls = readPulls(file)
val boards = readBoards(file)
return pulls.flatMap { pulledNumber ->
boards.filter { !it.won }
.onEa... | [
{
"class_path": "MariusSchmidt__adventofcode2021__2b70993/adventofcode/PuzzleDay04$BingoBoard$Companion.class",
"javap": "Compiled from \"PuzzleDay04.kt\"\npublic final class adventofcode.PuzzleDay04$BingoBoard$Companion {\n private adventofcode.PuzzleDay04$BingoBoard$Companion();\n Code:\n 0: alo... |
MariusSchmidt__adventofcode2021__2b70993/src/main/kotlin/adventofcode/PuzzleDay07.kt | package adventofcode
import java.io.File
import kotlin.math.*
/**
*
* PART I
* Interestingly enough, for any series of numbers in R^1 the central point that minimizes the sum of distances to each
* other point is the median. In fact "The median minimizes the sum of absolute deviations". Until AoC 2021 I did not
... | [
{
"class_path": "MariusSchmidt__adventofcode2021__2b70993/adventofcode/PuzzleDay07.class",
"javap": "Compiled from \"PuzzleDay07.kt\"\npublic final class adventofcode.PuzzleDay07 {\n public adventofcode.PuzzleDay07();\n Code:\n 0: aload_0\n 1: invokespecial #8 // Method java... |
MariusSchmidt__adventofcode2021__2b70993/src/main/kotlin/adventofcode/PuzzleDay03.kt | package adventofcode
import java.io.File
class PuzzleDay03(significantBits: Int) {
private val histogramSize = significantBits * 2
fun readGammaAndEpsilon(input: File): Pair<Int, Int> =
input.useLines { bitsSequence ->
val gammaBits = bitsSequence.deriveBitmask(true)
val gamm... | [
{
"class_path": "MariusSchmidt__adventofcode2021__2b70993/adventofcode/PuzzleDay03.class",
"javap": "Compiled from \"PuzzleDay03.kt\"\npublic final class adventofcode.PuzzleDay03 {\n private final int histogramSize;\n\n public adventofcode.PuzzleDay03(int);\n Code:\n 0: aload_0\n 1: invokes... |
fabmax__kool__85fe1de/kool-core/src/commonMain/kotlin/de/fabmax/kool/math/Partition.kt | package de.fabmax.kool.math
import kotlin.math.*
fun <T> MutableList<T>.partition(k: Int, cmp: (T, T) -> Int) = partition(indices, k, cmp)
fun <T> MutableList<T>.partition(rng: IntRange, k: Int, cmp: (T, T) -> Int) {
partition(this, rng.first, rng.last, k, { get(it) }, cmp, { a, b -> this[a] = this[b].also { th... | [
{
"class_path": "fabmax__kool__85fe1de/de/fabmax/kool/math/PartitionKt.class",
"javap": "Compiled from \"Partition.kt\"\npublic final class de.fabmax.kool.math.PartitionKt {\n public static final <T> void partition(java.util.List<T>, int, kotlin.jvm.functions.Function2<? super T, ? super T, java.lang.Integ... |
korilin__DSA-kt__b96ba1b/src/main/kotlin/sort_algorithm/quickSort.kt | package sort_algorithm
/**
* 快速排序
* 时间复杂度：
* 最优时间复杂度：Ο(n*log(n))
* 平均时间复杂度：Ο(n*log(n))
* 最坏时间复杂度：Ο(n²)
* 空间复杂度：Ο(1)
*
* Quick Sort
* Time Complexity:
* Optimal Time Complexity: Ο(n*log(n))
* Average Time Complexity: Ο(n*log(n))
* Worst Time Complexity: Ο(n²)
* Space Complexity: Ο(1)
*/
fun qu... | [
{
"class_path": "korilin__DSA-kt__b96ba1b/sort_algorithm/QuickSortKt.class",
"javap": "Compiled from \"quickSort.kt\"\npublic final class sort_algorithm.QuickSortKt {\n public static final void quickSort(int[]);\n Code:\n 0: aload_0\n 1: ldc #9 // String array\n ... |
ErikHellman__advent-of-code-2021__37f54d5/day4/src/main/kotlin/day4/Main.kt | package day4
import java.io.File
import java.util.regex.Pattern
fun main(args: Array<String>) {
val lines = loadFile("input.txt")
val numbersDrawn = lines[0]
val boards = lines.drop(1)
.chunked(5)
.map { board ->
board.map { line -> line.map { it to false }.toMutableList() }.to... | [
{
"class_path": "ErikHellman__advent-of-code-2021__37f54d5/day4/MainKt.class",
"javap": "Compiled from \"Main.kt\"\npublic final class day4.MainKt {\n public static final void main(java.lang.String[]);\n Code:\n 0: aload_0\n 1: ldc #9 // String args\n 3: invo... |
ErikHellman__advent-of-code-2021__37f54d5/day5/src/main/kotlin/day5/Main.kt | package day5
import java.io.File
import kotlin.math.absoluteValue
data class Point(val x: Int, val y: Int)
fun main(args: Array<String>) {
val diagram = HashMap<Point, Int>()
File("input.txt").readLines().forEach { line ->
val (start, end) = line
.split("->")
.map { pair ->
... | [
{
"class_path": "ErikHellman__advent-of-code-2021__37f54d5/day5/MainKt.class",
"javap": "Compiled from \"Main.kt\"\npublic final class day5.MainKt {\n public static final void main(java.lang.String[]);\n Code:\n 0: aload_0\n 1: ldc #9 // String args\n 3: invo... |
agapeteo__kotlin-data-algo__b5662c8/src/arrays/Experiment.kt | package arrays
import java.io.File
import java.util.*
fun main() {
printDirContent(File("/Users/emix/go/src/practicalalgo"))
}
fun printDirContent(dir: File, tabsCount: Int = 0, ignoreHidden: Boolean = true) {
require(dir.exists()) { "$dir must exist" }
require(dir.isDirectory) { "$dir must be directo... | [
{
"class_path": "agapeteo__kotlin-data-algo__b5662c8/arrays/ExperimentKt.class",
"javap": "Compiled from \"Experiment.kt\"\npublic final class arrays.ExperimentKt {\n public static final void main();\n Code:\n 0: new #8 // class java/io/File\n 3: dup\n 4: ldc... |
benjaminknauer__advent-of-code-22-kotlin__fcf41be/src/day01/Day01.kt | package day01
import java.io.File
data class Sweet(val calories: Int)
data class Elf(val sweets: List<Sweet>) {
fun getCaloriesSum(): Int {
return sweets.sumOf { it.calories }
}
}
fun parseInput(input: String): List<Elf> {
return input.split("\n\n")
.map { elf ->
val sweets = ... | [
{
"class_path": "benjaminknauer__advent-of-code-22-kotlin__fcf41be/day01/Day01Kt$getCaloriesOfTopNElves$$inlined$sortedByDescending$1.class",
"javap": "Compiled from \"Comparisons.kt\"\npublic final class day01.Day01Kt$getCaloriesOfTopNElves$$inlined$sortedByDescending$1<T> implements java.util.Comparator {... |
benjaminknauer__advent-of-code-22-kotlin__fcf41be/src/day02/Day02.kt | package day02
import java.io.File
import java.lang.IllegalArgumentException
enum class Move(val score: Int) {
ROCK(1), PAPER(2), SCISSORS(3);
companion object {
fun fromShortcode(shortcode: String): Move {
return when (shortcode) {
"A", "X" -> ROCK
"B", "Y"... | [
{
"class_path": "benjaminknauer__advent-of-code-22-kotlin__fcf41be/day02/Day02Kt.class",
"javap": "Compiled from \"Day02.kt\"\npublic final class day02.Day02Kt {\n public static final day02.Game parseInputPart1(java.lang.String);\n Code:\n 0: aload_0\n 1: ldc #9 //... |
Sladernom__Hyperskill-Cinema-Project__90d3400/src.kt | package cinema
var totalIncome = 0
fun setupCinema(): Pair<Int, Int> {
println("Enter the number of rows:")
val numRows: Int = readln()!!.toInt()
println("Enter the number of seats in each row:")
val seatsInRow: Int = readln()!!.toInt()
return Pair(numRows, seatsInRow)
}
fun printCinema(topList: ... | [
{
"class_path": "Sladernom__Hyperskill-Cinema-Project__90d3400/cinema/SrcKt.class",
"javap": "Compiled from \"src.kt\"\npublic final class cinema.SrcKt {\n private static int totalIncome;\n\n public static final int getTotalIncome();\n Code:\n 0: getstatic #10 // Field totalIn... |
rafaelnogueiradev__Cinema-Room-Manager-Kotlin__b9a8d89/Stage_5/src/main/kotlin/Main.kt | package cinema
const val STANDARD: Int = 10
const val DISCOUNT: Int = 8
const val B_SYMBOL: Char = 'B'
const val S_SYMBOL: Char = 'S'
const val SMALL_ROOM: Int = 60
enum class Cinema(var number: Int) {
ROW(7), SEATS(8),
TOTAL_SEATS(ROW.number * SEATS.number),
SELECT_ROW(0), SELECT_SEAT(0),
PURCHASED_T... | [
{
"class_path": "rafaelnogueiradev__Cinema-Room-Manager-Kotlin__b9a8d89/cinema/MainKt.class",
"javap": "Compiled from \"Main.kt\"\npublic final class cinema.MainKt {\n public static final int STANDARD;\n\n public static final int DISCOUNT;\n\n public static final char B_SYMBOL;\n\n public static final c... |
callej__Search-Engine__81f9b14/Main.kt | package search
import java.io.File
const val MENU = "=== Menu ===\n" +
"1. Find a person\n" +
"2. Print all people\n" +
"0. Exit"
fun findPerson(people: List<String> ,pIndex: Map<String, Set<Int>>) {
println("\nSelect a matching strategy: ALL, ANY, NONE")
val strategy = readLine()!!.u... | [
{
"class_path": "callej__Search-Engine__81f9b14/search/MainKt.class",
"javap": "Compiled from \"Main.kt\"\npublic final class search.MainKt {\n public static final java.lang.String MENU;\n\n public static final void findPerson(java.util.List<java.lang.String>, java.util.Map<java.lang.String, ? extends jav... |
RichCodersAndMe__LeetCode-Solution__96119bb/src/_004/kotlin/Solution.kt | package _004.kotlin
/**
* @author relish
* @since 2018/10/20
*/
class Solution {
fun findMedianSortedArrays(nums1: IntArray, nums2: IntArray): Double {
val len = nums1.size + nums2.size
return if (len % 2 == 0) {
(fix(nums1, 0, nums2, 0, len / 2) + fix(nums1, 0, nums2, 0, len / 2 + 1... | [
{
"class_path": "RichCodersAndMe__LeetCode-Solution__96119bb/_004/kotlin/Solution.class",
"javap": "Compiled from \"Solution.kt\"\npublic final class _004.kotlin.Solution {\n public _004.kotlin.Solution();\n Code:\n 0: aload_0\n 1: invokespecial #8 // Method java/lang/Object... |
amazon-ion__ion-schema-kotlin__bbab678/ion-schema/src/main/kotlin/com/amazon/ionschema/model/ContinuousRange.kt | package com.amazon.ionschema.model
import com.amazon.ionschema.model.ContinuousRange.Limit
interface IContinuousRange<T> where T : Comparable<T>, T : Any {
val start: Limit<T>
val end: Limit<T>
operator fun contains(value: T): Boolean
fun intersect(that: ContinuousRange<T>): Pair<Limit<T>, Limit<T>>?
... | [
{
"class_path": "amazon-ion__ion-schema-kotlin__bbab678/com/amazon/ionschema/model/ContinuousRange$Limit$Open.class",
"javap": "Compiled from \"ContinuousRange.kt\"\npublic final class com.amazon.ionschema.model.ContinuousRange$Limit$Open<T extends java.lang.Comparable<? super T>> extends com.amazon.ionsche... |
illarionov__strstr__2ead438/code/src/main/kotlin/substring/TwoWay.kt | package substring
import java.lang.Integer.MAX_VALUE
import kotlin.math.abs
private val IntProgression.length get() = when (this.step) {
1, -1 -> if (!this.isEmpty()) abs(this.last - this.first) + 1 else 0
else -> count()
}
class TwoWay {
internal data class Factorization(val pattern: String,
... | [
{
"class_path": "illarionov__strstr__2ead438/substring/TwoWay.class",
"javap": "Compiled from \"TwoWay.kt\"\npublic final class substring.TwoWay {\n public substring.TwoWay();\n Code:\n 0: aload_0\n 1: invokespecial #8 // Method java/lang/Object.\"<init>\":()V\n 4: ret... |
vaclavbohac__advent-of-code-2023__daa1feb/src/main/kotlin/com/vaclavbohac/advent2023/day3/GearRatios.kt | package com.vaclavbohac.advent2023.day3
class GearRatios(private val lines: List<String>) {
fun getSumOfAllParts(): Int {
val validNumbers = mutableListOf<Int>()
lines.forEachIndexed { i, line ->
var j = 0
var number = StringBuffer()
var indexStart = 0
... | [
{
"class_path": "vaclavbohac__advent-of-code-2023__daa1feb/com/vaclavbohac/advent2023/day3/GearRatios.class",
"javap": "Compiled from \"GearRatios.kt\"\npublic final class com.vaclavbohac.advent2023.day3.GearRatios {\n private final java.util.List<java.lang.String> lines;\n\n public com.vaclavbohac.advent... |
vaclavbohac__advent-of-code-2023__daa1feb/src/main/kotlin/com/vaclavbohac/advent2023/day1/Trebuchet.kt | package com.vaclavbohac.advent2023.day1
class Trebuchet(private val lines: List<String>) {
fun sumCalibratedValues(): Int =
lines.fold(0) { sum, line -> sum + (line.getFirstDigit() * 10 + line.reversed().getFirstDigit()) }
fun sumCalibratedValuesAfterInterpolation(): Int =
lines.fold(0) { sum,... | [
{
"class_path": "vaclavbohac__advent-of-code-2023__daa1feb/com/vaclavbohac/advent2023/day1/TrebuchetKt.class",
"javap": "Compiled from \"Trebuchet.kt\"\npublic final class com.vaclavbohac.advent2023.day1.TrebuchetKt {\n private static final int getFirstDigit(java.lang.String);\n Code:\n 0: aload_0... |
liueq__LeetCodePractice__dda0178/src/main/java/com/liueq/leetcode/easy/NextGreaterElementI.kt | package com.liueq.leetcode.easy
import java.util.*
/**
* 问题描述：给定两个数组 nums1, nums2。其中 1 是 2的子集。求nums1 每一个element 在 nums2 中的位置，往后最大的数字。如果不存在，用 -1 代替。
* 比如： [4, 1, 2]
* [1, 3, 4, 2]
* =
* [-1, 3, -1] 因为 4 在 nums2 中往后只有一个 2，不比4大，所以不存在；1在 nums2 中，往后第一个比 1 大的是3，所以返回3。同理。
*
* 解：先求出 nums2 每一个 element... | [
{
"class_path": "liueq__LeetCodePractice__dda0178/com/liueq/leetcode/easy/NextGreaterElementI.class",
"javap": "Compiled from \"NextGreaterElementI.kt\"\npublic final class com.liueq.leetcode.easy.NextGreaterElementI {\n public com.liueq.leetcode.easy.NextGreaterElementI();\n Code:\n 0: aload_0\n ... |
liminalitythree__bakadesu__6d5fbcc/src/main/kotlin/lain/Range.kt | package lain
import kotlin.math.abs
data class Range(val min:Int, val max: Int) {
init {
if (min > max) {
throw Exception("Range created with min greater than max, min: $min max: $max")
}
}
companion object {
fun and(a:Range, b:Range):Range {
val min = if (... | [
{
"class_path": "liminalitythree__bakadesu__6d5fbcc/lain/Range$Companion.class",
"javap": "Compiled from \"Range.kt\"\npublic final class lain.Range$Companion {\n private lain.Range$Companion();\n Code:\n 0: aload_0\n 1: invokespecial #8 // Method java/lang/Object.\"<init>\"... |
liminalitythree__bakadesu__6d5fbcc/src/main/kotlin/lain/RangeList.kt | package lain
import java.math.BigInteger
data class RangeList(val list: List<Range>) {
companion object {
// creates a rangelist from input range
// merges ranges that overlap
fun from(list: List<Range>):RangeList {
val first = RangeList(listOf(list[0]))
val rest = ... | [
{
"class_path": "liminalitythree__bakadesu__6d5fbcc/lain/RangeList.class",
"javap": "Compiled from \"RangeList.kt\"\npublic final class lain.RangeList {\n public static final lain.RangeList$Companion Companion;\n\n private final java.util.List<lain.Range> list;\n\n public lain.RangeList(java.util.List<la... |
ZorteK__Yatzy-Refactoring-Kata__885ee1f/kotlin/src/main/kotlin/com/zortek/kata/yatzy/DiceRoll.kt | package com.zortek.kata.yatzy
import java.util.stream.Stream
class DiceRoll(private val dice: List<Int>) {
fun yatzy(): Boolean {
return groupByValue()
.values
.any { it == 5 }
}
fun isFullHouse(): Boolean {
val hasThreeOfAKind = getDiceWithCountGreaterThan(3) != 0... | [
{
"class_path": "ZorteK__Yatzy-Refactoring-Kata__885ee1f/com/zortek/kata/yatzy/DiceRoll$groupByValue$$inlined$groupingBy$1.class",
"javap": "Compiled from \"_Collections.kt\"\npublic final class com.zortek.kata.yatzy.DiceRoll$groupByValue$$inlined$groupingBy$1 implements kotlin.collections.Grouping<java.lan... |
MMauro94__media-merger__40a1d36/src/main/kotlin/com/github/mmauro94/media_merger/util/DurationUtils.kt | package com.github.mmauro94.media_merger.util
import java.math.BigDecimal
import java.time.Duration
import java.util.concurrent.TimeUnit
fun Duration.toTimeString(): String {
val abs = abs()
val firstPart = (if (isNegative) "-" else "") + mutableListOf<String>().apply {
fun add(v: Int) {
... | [
{
"class_path": "MMauro94__media-merger__40a1d36/com/github/mmauro94/media_merger/util/DurationUtilsKt.class",
"javap": "Compiled from \"DurationUtils.kt\"\npublic final class com.github.mmauro94.media_merger.util.DurationUtilsKt {\n public static final java.lang.String toTimeString(java.time.Duration);\n ... |
ch8n__Big-Brain-Kotlin__e0619eb/src/main/kotlin/final_450/arrays/exam.kt | package final_450.arrays
fun main() {
val input = "23"
val numbers = arrayOf<String>("123", "234", "567")
val names = arrayOf<String>("chetan", "pokemon", "sokemon")
val result = numbers
.zip(names)
.sortedBy { it.second }
.firstOrNull {
it.first.contains(input)
... | [
{
"class_path": "ch8n__Big-Brain-Kotlin__e0619eb/final_450/arrays/ExamKt$main$$inlined$sortedBy$1.class",
"javap": "Compiled from \"Comparisons.kt\"\npublic final class final_450.arrays.ExamKt$main$$inlined$sortedBy$1<T> implements java.util.Comparator {\n public final_450.arrays.ExamKt$main$$inlined$sorte... |
ch8n__Big-Brain-Kotlin__e0619eb/src/main/kotlin/final_450/arrays/kthSmallOrLargeElement.kt | package final_450.arrays
fun main() {
// Given an array arr[] and a number K where K is smaller
// than size of array, the task is to find the Kth smallest
// element in the given array.
// It is given that all array elements are distinct.
/**
* * N = 6 arr[] = 7 10 4 3 20 15 K = 3 Output : 7... | [
{
"class_path": "ch8n__Big-Brain-Kotlin__e0619eb/final_450/arrays/KthSmallOrLargeElementKt.class",
"javap": "Compiled from \"kthSmallOrLargeElement.kt\"\npublic final class final_450.arrays.KthSmallOrLargeElementKt {\n public static final void main();\n Code:\n 0: iconst_3\n 1: istore_0\n ... |
marc-bouvier-katas__aoc-02__2198922/kotlin/src/elves/day03/RuckSack.kt | package elves.day03
class RuckSack(private val elveEncodedContent: String) {
val priorityOfSharedCategory: Int?
init {
val firstCompartment = Compartment(elveEncodedContent.take(elveEncodedContent.length / 2))
val secondCompartment = Compartment(elveEncodedContent.takeLast(elveEncodedContent.... | [
{
"class_path": "marc-bouvier-katas__aoc-02__2198922/elves/day03/RuckSackKt.class",
"javap": "Compiled from \"RuckSack.kt\"\npublic final class elves.day03.RuckSackKt {\n public static final int ASCIICODE_FOR_A_LOWERCASE;\n\n public static final int ASCIICODE_FOR_A_UPPERCASE;\n\n}\n",
"javap_err": ""
... |
OpenSrcerer__aoc-2022__84b9b62/AoC2022/src/main/kotlin/xyz/danielstefani/Day8.kt | package xyz.danielstefani
import java.util.function.Function
lateinit var trees: List<List<Int>>
const val GRID_SIZE = 4
fun main() {
trees = object {}.javaClass
.classLoader
.getResource("Day8Input.in")!!
.readText()
.split("\n")
.map { it.map { it.digitToInt() }.toList()... | [
{
"class_path": "OpenSrcerer__aoc-2022__84b9b62/xyz/danielstefani/Day8Kt$main$1.class",
"javap": "Compiled from \"Day8.kt\"\npublic final class xyz.danielstefani.Day8Kt$main$1 {\n xyz.danielstefani.Day8Kt$main$1();\n Code:\n 0: aload_0\n 1: invokespecial #8 // Method java/la... |
OpenSrcerer__aoc-2022__84b9b62/AoC2022/src/main/kotlin/xyz/danielstefani/Day3.kt | package xyz.danielstefani
import java.util.stream.IntStream
import kotlin.streams.asSequence
val priorityMap = mutableMapOf<Int, Int>()
fun main() {
// Prep
fillMapWithPriorities(97, 122, 1)
fillMapWithPriorities(65, 90, 27)
val splitRucksacks = object {}.javaClass
.classLoader
.getR... | [
{
"class_path": "OpenSrcerer__aoc-2022__84b9b62/xyz/danielstefani/Day3Kt.class",
"javap": "Compiled from \"Day3.kt\"\npublic final class xyz.danielstefani.Day3Kt {\n private static final java.util.Map<java.lang.Integer, java.lang.Integer> priorityMap;\n\n public static final java.util.Map<java.lang.Intege... |
OpenSrcerer__aoc-2022__84b9b62/AoC2022/src/main/kotlin/xyz/danielstefani/Day2.kt | package xyz.danielstefani
import kotlin.math.abs
val shapeToScore = mapOf(
Pair("A", 1), // Rock
Pair("B", 2), // Paper
Pair("C", 3), // Scissors
Pair("X", 1), // Rock
Pair("Y", 2), // Paper
Pair("Z", 3) // Scissors
)
fun main(args: Array<String>) {
// Prep
val rounds = object {}.jav... | [
{
"class_path": "OpenSrcerer__aoc-2022__84b9b62/xyz/danielstefani/Day2Kt.class",
"javap": "Compiled from \"Day2.kt\"\npublic final class xyz.danielstefani.Day2Kt {\n private static final java.util.Map<java.lang.String, java.lang.Integer> shapeToScore;\n\n public static final java.util.Map<java.lang.String... |
gualtierotesta__PlayWithKotlin__8366bb3/kata/src/main/kotlin/kata/ColorChoice.kt | package kata
import java.math.BigInteger
/*
You know combinations: for example, if you take 5 cards from a 52 cards deck you have 2,598,960
different combinations.
In mathematics the number of x combinations you can take from a set of n elements is called the
binomial coefficient of n and x, or more often n choose x... | [
{
"class_path": "gualtierotesta__PlayWithKotlin__8366bb3/kata/ColorChoiceKt.class",
"javap": "Compiled from \"ColorChoice.kt\"\npublic final class kata.ColorChoiceKt {\n public static final java.math.BigInteger fact(int);\n Code:\n 0: getstatic #13 // Field java/math/BigInteger... |
gualtierotesta__PlayWithKotlin__8366bb3/kata/src/main/kotlin/kata/HowGreenIsMyValley.kt | package kata
import java.util.*
import java.util.stream.Collectors.toList
/*
Input : an array of integers.
Output : this array, but sorted in such a way that there are two wings:
the left wing with numbers decreasing,
the right wing with numbers increasing.
the two wings have the sa... | [
{
"class_path": "gualtierotesta__PlayWithKotlin__8366bb3/kata/HowGreenIsMyValleyKt.class",
"javap": "Compiled from \"HowGreenIsMyValley.kt\"\npublic final class kata.HowGreenIsMyValleyKt {\n public static final int[] makeValley(int[]);\n Code:\n 0: aload_0\n 1: ldc #9 ... |
CristianoVecchi__MikroKanon__291915e/app/src/main/java/com/cristianovecchi/mikrokanon/dataAnalysis/Kmeans.kt | package com.cristianovecchi.mikrokanon.dataAnalysis
// version 1.2.21
import java.util.Random
import kotlin.math.*
data class Point(var x: Double, var y: Double, var group: Int, val partIndex: Int, val noteIndex: Int)
typealias LPoint = List<Point>
typealias MLPoint = MutableList<Point>
val origin get() = Point(0.... | [
{
"class_path": "CristianoVecchi__MikroKanon__291915e/com/cristianovecchi/mikrokanon/dataAnalysis/KmeansKt$main$$inlined$groupingBy$1.class",
"javap": "Compiled from \"_Collections.kt\"\npublic final class com.cristianovecchi.mikrokanon.dataAnalysis.KmeansKt$main$$inlined$groupingBy$1 implements kotlin.coll... |
umrhiumrhi__skt-summer-internship-2022__6c4bc15/app/src/main/java/com/skt/nugu/sampleapp/utils/SimilarityChecker.kt | package com.skt.nugu.sampleapp.utils
import java.lang.Integer.max
import java.lang.Math.min
class SimilarityChecker {
companion object {
private const val korBegin = 44032
private const val korEnd = 55203
private const val chosungBase = 588
private const val jungsungBase = 28
... | [
{
"class_path": "umrhiumrhi__skt-summer-internship-2022__6c4bc15/com/skt/nugu/sampleapp/utils/SimilarityChecker.class",
"javap": "Compiled from \"SimilarityChecker.kt\"\npublic final class com.skt.nugu.sampleapp.utils.SimilarityChecker {\n public static final com.skt.nugu.sampleapp.utils.SimilarityChecker$... |
stellake__git-training__d4b42d8/src/main/kotlin/com/gitTraining/Fibbonaci.kt | package com.gitTraining
fun computeFibbonaciNumber(position: Int?, recursion: Boolean = false): Int {
var notNullPosition = position
if (notNullPosition == null) {
notNullPosition = 1
}
if (recursion) return recursiveFibbonachi(1, 1, notNullPosition - 2)
if (notNullPosition == 0) return 0
... | [
{
"class_path": "stellake__git-training__d4b42d8/com/gitTraining/FibbonaciKt.class",
"javap": "Compiled from \"Fibbonaci.kt\"\npublic final class com.gitTraining.FibbonaciKt {\n public static final int computeFibbonaciNumber(java.lang.Integer, boolean);\n Code:\n 0: aload_0\n 1: astore_2\n ... |
justnero__university__14f58f1/semestr.06/ТРСиПВ/bellman/src/main/kotlin/bellman/graph/util.kt | package bellman.graph
val INFINITE = Int.MAX_VALUE
val NO_EDGE = INFINITE
typealias AdjacencyMatrix = Array<IntArray>
typealias AdjacencyMatrix1D = IntArray
typealias AdjacencyList = Array<Adjacency>
typealias PlainAdjacencyList = IntArray
typealias Adjacency = Triple<Int, Int, Int>
data class InputGraph(val adjace... | [
{
"class_path": "justnero__university__14f58f1/bellman/graph/Util$PlainAdjacencyListUtil.class",
"javap": "Compiled from \"util.kt\"\npublic final class bellman.graph.Util$PlainAdjacencyListUtil {\n public static final bellman.graph.Util$PlainAdjacencyListUtil INSTANCE;\n\n private bellman.graph.Util$Plai... |
justnero__university__14f58f1/semestr.06/ТРСиПВ/bellman/src/main/kotlin/bellman/graph/algorithm/plainBellmanFord.kt | package bellman.graph.algorithm
import bellman.graph.INFINITE
import bellman.graph.InputGraph
import bellman.graph.PlainAdjacency
import bellman.graph.PlainAdjacencyList
import bellman.graph.Util.AdjacencyMatrixUtil.toPlainAdjacencyList
import bellman.graph.Util.PlainAdjacencyListUtil.edgeNumber
import bellman.graph.U... | [
{
"class_path": "justnero__university__14f58f1/bellman/graph/algorithm/PlainBellmanFordKt.class",
"javap": "Compiled from \"plainBellmanFord.kt\"\npublic final class bellman.graph.algorithm.PlainBellmanFordKt {\n public static final int[] bellmanFord(bellman.graph.InputGraph);\n Code:\n 0: aload_0... |
justnero__university__14f58f1/semestr.06/ТРСиПВ/bellman/src/main/kotlin/bellman/graph/algorithm/bellmanFord.kt | package bellman.graph.algorithm
import bellman.graph.Adjacency
import bellman.graph.AdjacencyList
import bellman.graph.INFINITE
import bellman.graph.Util.AdjacencyUtil.destination
import bellman.graph.Util.AdjacencyUtil.source
import bellman.graph.Util.AdjacencyUtil.weight
fun bellmanFord(adjacencyList: AdjacencyList... | [
{
"class_path": "justnero__university__14f58f1/bellman/graph/algorithm/BellmanFordKt.class",
"javap": "Compiled from \"bellmanFord.kt\"\npublic final class bellman.graph.algorithm.BellmanFordKt {\n public static final int[] bellmanFord(kotlin.Triple<java.lang.Integer, java.lang.Integer, java.lang.Integer>[... |
CDCgov__data-exchange-hl7__e859ed7/deprecated/fn-mmg-validator/src/main/kotlin/gov/cdc/dex/hl7/model/ValidationIssue.kt | package gov.cdc.dex.hl7.model
enum class ValidationIssueCategoryType(val message: String) {
ERROR("Error"),
WARNING("Warning");
}
enum class ValidationIssueType(val message: String) {
DATA_TYPE("data_type"),
CARDINALITY("cardinality"),
VOCAB("vocabulary"),
SEGMENT_NOT_IN_MMG("segment_not_in... | [
{
"class_path": "CDCgov__data-exchange-hl7__e859ed7/gov/cdc/dex/hl7/model/ValidationIssue.class",
"javap": "Compiled from \"ValidationIssue.kt\"\npublic final class gov.cdc.dex.hl7.model.ValidationIssue {\n private final gov.cdc.dex.hl7.model.ValidationIssueCategoryType classification;\n\n private final g... |
lorenzo-piersante__HackerRank-ProjectEuler__6159bb4/src/main/problem7/solution.kt | package problem7
import java.util.Scanner
import kotlin.math.ceil
import kotlin.math.sqrt
private fun isPrime(n: Int) : Boolean {
val maxDivider = ceil(sqrt(n.toDouble())).toInt()
for (i in 2..maxDivider) {
if (n % i == 0) return false
}
return true
}
val primeNumbers = mutableSetOf(2, 3, 5... | [
{
"class_path": "lorenzo-piersante__HackerRank-ProjectEuler__6159bb4/problem7/SolutionKt.class",
"javap": "Compiled from \"solution.kt\"\npublic final class problem7.SolutionKt {\n private static final java.util.Set<java.lang.Integer> primeNumbers;\n\n private static final boolean isPrime(int);\n Code:... |
lorenzo-piersante__HackerRank-ProjectEuler__6159bb4/src/main/problem4/solution2.kt | package problem4
import java.util.Scanner
private fun isPalindrome(n : Int) : Boolean {
val straight = n.toString()
val reversed = straight.reversed()
return straight == reversed
}
private fun getPreviousPalindrome(n : Int) : Int {
var prev = n
while (! isPalindrome(prev)) prev--
return pre... | [
{
"class_path": "lorenzo-piersante__HackerRank-ProjectEuler__6159bb4/problem4/Solution2Kt.class",
"javap": "Compiled from \"solution2.kt\"\npublic final class problem4.Solution2Kt {\n private static final boolean isPalindrome(int);\n Code:\n 0: iload_0\n 1: invokestatic #12 ... |
Undiy__hyperskill-kotlin-core__70695fb/Phone Book (Kotlin)/Phone Book (Kotlin)/task/src/phonebook/Main.kt | package phonebook
import java.io.BufferedReader
import java.io.File
import java.io.FileReader
import java.lang.Integer.min
import java.util.*
import kotlin.math.sqrt
import kotlin.streams.asSequence
const val FIND_FILENAME = "find.txt"
const val DIRECTORY_FILENAME = "directory.txt"
fun getRecordName(record: String) ... | [
{
"class_path": "Undiy__hyperskill-kotlin-core__70695fb/phonebook/MainKt$main$linearTime$1.class",
"javap": "Compiled from \"Main.kt\"\nfinal class phonebook.MainKt$main$linearTime$1 extends kotlin.jvm.internal.FunctionReferenceImpl implements kotlin.jvm.functions.Function1<java.lang.String, java.lang.Boole... |
Simplation__OpenSourceRepository__d45feaa/算法/两数之和1.kt | package com.example.rain_demo.algorithm
/**
*@author: Rain
*@time: 2022/7/14 9:40
*@version: 1.0
*@description: 给定一个整数数组 nums 和一个整数目标值 target，请你在该数组中找出 和为目标值 target 的那 两个 整数，并返回它们的数组下标。
你可以假设每种输入只会对应一个答案。但是，数组中同一个元素在答案里不能重复出现。
*/
/**
* 输入：nums = [2,7,11,15], target = 9
* 输出：[0,1]
* 解释：因为 nums[0] + nums[1] ==... | [
{
"class_path": "Simplation__OpenSourceRepository__d45feaa/com/example/rain_demo/algorithm/两数之和1Kt.class",
"javap": "Compiled from \"两数之和1.kt\"\npublic final class com.example.rain_demo.algorithm.两数之和1Kt {\n public static final void main();\n Code:\n 0: iconst_2\n 1: newarray int\n ... |
Simplation__OpenSourceRepository__d45feaa/算法/寻找两个正序数组的中位数4.kt | package com.example.rain_demo.algorithm
/**
*@author: Rain
*@time: 2022/7/20 14:34
*@version: 1.0
*@description: 寻找两个正序数组的中位数
*/
fun main() {
val nums1 = intArrayOf(1, 3)
val nums2 = intArrayOf(2)
val size1 = nums1.size
val size2 = nums2.size
val size = size1 + size2
if (size % 2 == 0) {... | [
{
"class_path": "Simplation__OpenSourceRepository__d45feaa/com/example/rain_demo/algorithm/寻找两个正序数组的中位数4Kt.class",
"javap": "Compiled from \"寻找两个正序数组的中位数4.kt\"\npublic final class com.example.rain_demo.algorithm.寻找两个正序数组的中位数4Kt {\n public static final void main();\n Code:\n 0: iconst_2\n 1: ... |
Simplation__OpenSourceRepository__d45feaa/算法/一维数组的动态和1480.kt | package com.example.rain_demo.algorithm
/**
*@author: Rain
*@time: 2022/7/14 9:33
*@version: 1.0
*@description: 一维数组的动态和
* 给你一个数组 nums 。数组「动态和」的计算公式为：runningSum[i] = sum(nums[0]…nums[i])。请返回 nums 的动态和。
* val nums = intArrayOf(3, 1, 2, 10, 1)
* val nums = intArrayOf(1,2,3,4)
*/
fun main() {
val nums = intA... | [
{
"class_path": "Simplation__OpenSourceRepository__d45feaa/com/example/rain_demo/algorithm/一维数组的动态和1480Kt.class",
"javap": "Compiled from \"一维数组的动态和1480.kt\"\npublic final class com.example.rain_demo.algorithm.一维数组的动态和1480Kt {\n public static final void main();\n Code:\n 0: iconst_5\n 1: new... |
li2__android-architecture__010d25e/hikotlin/src/main/java/me/li2/android/hikotlin/kotlin/Calculator.kt | package me.li2.android.hikotlin.kotlin
import me.li2.android.hikotlin.kotlin.Operator.*
import java.util.*
/** + */
fun operatorPlus(input: Int): Int {
return input + MY_PLUS
}
/** - */
fun operatorMinus(input: Int): Int {
return input + MY_MINUS
}
/** x */
fun operatorMultiply(input: Int): Int {
retur... | [
{
"class_path": "li2__android-architecture__010d25e/me/li2/android/hikotlin/kotlin/CalculatorKt$WhenMappings.class",
"javap": "Compiled from \"Calculator.kt\"\npublic final class me.li2.android.hikotlin.kotlin.CalculatorKt$WhenMappings {\n public static final int[] $EnumSwitchMapping$0;\n\n static {};\n ... |
Josef-TL__app-dev__f613326/hand-ins/app/src/main/java/com/example/handins/hand_in_1.kt | package com.example.handins
import java.util.Scanner
fun main(){
checkAge()
val max : Int = getMax(1,18,8);
val min : Int = getMin(1,18,-8);
println(max); //18
println(min); //-8
val numList: List<Int> = listOf(0,-12,4,6,123)
println("Average of the list ${numList} is: " + calculateAverag... | [
{
"class_path": "Josef-TL__app-dev__f613326/com/example/handins/Hand_in_1Kt.class",
"javap": "Compiled from \"hand_in_1.kt\"\npublic final class com.example.handins.Hand_in_1Kt {\n public static final void main();\n Code:\n 0: invokestatic #9 // Method checkAge:()V\n 3: ico... |
KingChampion36__data-structures-and-algorithms__a276937/src/main/kotlin/com/kingchampion36/dsa/arrays/KthSmallestAndLargestElement.kt | package com.kingchampion36.dsa.arrays
import java.util.PriorityQueue
/**
* Sort the list and find kth smallest element
* Time complexity - O(n * log(n))
*/
fun List<Int>.kthSmallestElementBySorting(k: Int) = when {
isEmpty() -> throw IllegalArgumentException("List should not be empty")
k <= 0 || k >= size -> t... | [
{
"class_path": "KingChampion36__data-structures-and-algorithms__a276937/com/kingchampion36/dsa/arrays/KthSmallestAndLargestElementKt.class",
"javap": "Compiled from \"KthSmallestAndLargestElement.kt\"\npublic final class com.kingchampion36.dsa.arrays.KthSmallestAndLargestElementKt {\n public static final ... |
rafaeltoledo__aoc2023__7bee985/src/main/kotlin/net/rafaeltoledo/kotlin/advent/Day04.kt | package net.rafaeltoledo.kotlin.advent
import kotlin.math.pow
class Day04 {
fun invoke(input: List<String>): Int {
val cards = input.map { it.toScratchCard() }
return cards
.map { card -> card.numbers.filter { card.winningNumbers.contains(it) } }
.sumOf { it.size.calculateCardValue() }
}
... | [
{
"class_path": "rafaeltoledo__aoc2023__7bee985/net/rafaeltoledo/kotlin/advent/Day04Kt.class",
"javap": "Compiled from \"Day04.kt\"\npublic final class net.rafaeltoledo.kotlin.advent.Day04Kt {\n private static final int calculateCardValue(int);\n Code:\n 0: ldc2_w #7 // dou... |
rafaeltoledo__aoc2023__7bee985/src/main/kotlin/net/rafaeltoledo/kotlin/advent/Day03.kt | package net.rafaeltoledo.kotlin.advent
class Day03 {
fun invoke(input: List<String>): Int {
val positioning = input.toPositioning()
return positioning.filter { it.checkBoundaries(input) }.sumOf { it.number }
}
fun invoke2(input: List<String>): Int {
val positioning = input.toPositioning()
ret... | [
{
"class_path": "rafaeltoledo__aoc2023__7bee985/net/rafaeltoledo/kotlin/advent/Day03Kt.class",
"javap": "Compiled from \"Day03.kt\"\npublic final class net.rafaeltoledo.kotlin.advent.Day03Kt {\n public static final void prettyPrint(net.rafaeltoledo.kotlin.advent.NumberPositioning, java.util.List<java.lang.... |
rafaeltoledo__aoc2023__7bee985/src/main/kotlin/net/rafaeltoledo/kotlin/advent/Day02.kt | package net.rafaeltoledo.kotlin.advent
class Day02 {
val validRound = Round(red = 12, green = 13, blue = 14)
fun invoke(input: List<String>): Int {
val games = input.map { it.toGame() }
return games.filter { it.isValid() }.sumOf { it.id }
}
fun invoke2(input: List<String>): Int {
val games = in... | [
{
"class_path": "rafaeltoledo__aoc2023__7bee985/net/rafaeltoledo/kotlin/advent/Day02Kt.class",
"javap": "Compiled from \"Day02.kt\"\npublic final class net.rafaeltoledo.kotlin.advent.Day02Kt {\n private static final net.rafaeltoledo.kotlin.advent.Round optimal(java.util.List<net.rafaeltoledo.kotlin.advent.... |
rafaeltoledo__aoc2023__7bee985/src/main/kotlin/net/rafaeltoledo/kotlin/advent/Day01.kt | package net.rafaeltoledo.kotlin.advent
private val numbers = mapOf(
"one" to 1,
"two" to 2,
"three" to 3,
"four" to 4,
"five" to 5,
"six" to 6,
"seven" to 7,
"eight" to 8,
"nine" to 9,
)
class Day01 {
fun invoke(rawInput: String): Int {
val lines = rawInput.split("\n").filter { it.isNotEmpty(... | [
{
"class_path": "rafaeltoledo__aoc2023__7bee985/net/rafaeltoledo/kotlin/advent/Day01.class",
"javap": "Compiled from \"Day01.kt\"\npublic final class net.rafaeltoledo.kotlin.advent.Day01 {\n public net.rafaeltoledo.kotlin.advent.Day01();\n Code:\n 0: aload_0\n 1: invokespecial #8 ... |
fachammer__tuwea__bc880bc/src/commonMain/kotlin/dev/achammer/tuwea/core/Core.kt | package dev.achammer.tuwea.core
import kotlin.random.Random
data class StudentCheckmarksEntry(
val firstName: String,
val lastName: String,
val idNumber: String,
val checkmarks: Set<String>
)
data class ParseConfiguration(
val csvDelimiter: Char,
val csvLineOffset: Int,
val preCheckmarksF... | [
{
"class_path": "fachammer__tuwea__bc880bc/dev/achammer/tuwea/core/CoreKt.class",
"javap": "Compiled from \"Core.kt\"\npublic final class dev.achammer.tuwea.core.CoreKt {\n private static final dev.achammer.tuwea.core.ParseConfiguration tuwelParseConfiguration;\n\n public static final dev.achammer.tuwea.c... |
KosmX__advent-of-code23__ad01ab8/src/main/kotlin/dev/kosmx/aoc23/differential/OhMoarMath.kt | package dev.kosmx.aoc23.differential
import kotlin.math.*
// It's beautiful how mathematical functions can be written down in functional programming :D
fun distance(totalTime: Int, buttonPress: Int): Int = (totalTime - buttonPress) * buttonPress // travel time times speed
// -(buttonPress^2) + totalTime*buttonPress... | [
{
"class_path": "KosmX__advent-of-code23__ad01ab8/dev/kosmx/aoc23/differential/OhMoarMathKt.class",
"javap": "Compiled from \"OhMoarMath.kt\"\npublic final class dev.kosmx.aoc23.differential.OhMoarMathKt {\n public static final int distance(int, int);\n Code:\n 0: iload_0\n 1: iload_1\n ... |
KosmX__advent-of-code23__ad01ab8/src/main/kotlin/dev/kosmx/aoc23/poker/WellItsNot.kt | package dev.kosmx.aoc23.poker
import java.io.File
import java.math.BigInteger
fun main() {
val games = File("poker.txt").readLines().map {
var (cards, score) = it.split(" ")
//cards = cards.replace("J", "X") Uncomment it to solve Part1
Hand(cards) to score.toInt()
}.sortedByDescending... | [
{
"class_path": "KosmX__advent-of-code23__ad01ab8/dev/kosmx/aoc23/poker/WellItsNotKt.class",
"javap": "Compiled from \"WellItsNot.kt\"\npublic final class dev.kosmx.aoc23.poker.WellItsNotKt {\n private static final dev.kosmx.aoc23.poker.Card WILDCARD;\n\n public static final void main();\n Code:\n ... |
KosmX__advent-of-code23__ad01ab8/src/main/kotlin/dev/kosmx/aoc23/garden/VirtualMemory.kt | package dev.kosmx.aoc23.garden
import java.io.File
import java.math.BigInteger
import kotlin.math.abs
typealias Offset = Pair<OpenEndRange<BigInteger>, BigInteger>
val OpenEndRange<BigInteger>.size: BigInteger
get() = endExclusive - start
val Offset.destination: OpenEndRange<BigInteger>
get() = (first.start... | [
{
"class_path": "KosmX__advent-of-code23__ad01ab8/dev/kosmx/aoc23/garden/VirtualMemoryKt$main$$inlined$sortedBy$1.class",
"javap": "Compiled from \"Comparisons.kt\"\npublic final class dev.kosmx.aoc23.garden.VirtualMemoryKt$main$$inlined$sortedBy$1<T> implements java.util.Comparator {\n public dev.kosmx.ao... |
KosmX__advent-of-code23__ad01ab8/src/main/kotlin/dev/kosmx/aoc23/stars/StarField.kt | package dev.kosmx.aoc23.stars
import java.io.File
import java.math.BigInteger
import kotlin.math.abs
operator fun MutableList<MutableList<Char>>.get(x: Int, y: Int): Char {
return this[y][x]
}
fun <T> List<T>.allPairings() = sequence {
for (a in indices) {
for (b in a + 1 ..< size) {
yiel... | [
{
"class_path": "KosmX__advent-of-code23__ad01ab8/dev/kosmx/aoc23/stars/StarFieldKt.class",
"javap": "Compiled from \"StarField.kt\"\npublic final class dev.kosmx.aoc23.stars.StarFieldKt {\n public static final char get(java.util.List<java.util.List<java.lang.Character>>, int, int);\n Code:\n 0: a... |
KosmX__advent-of-code23__ad01ab8/src/main/kotlin/dev/kosmx/aoc23/springs/Sets.kt | package dev.kosmx.aoc23.springs
import java.io.File
import java.math.BigInteger
import javax.swing.Spring
fun <T> Collection<T>.subsets(k: Int): Sequence<Collection<T>> = sequence {
if (k > size) throw IllegalArgumentException("k must be smaller than the superset size")
if (k == size) yield(this@subsets)
... | [
{
"class_path": "KosmX__advent-of-code23__ad01ab8/dev/kosmx/aoc23/springs/SetsKt$subsets$2.class",
"javap": "Compiled from \"Sets.kt\"\nfinal class dev.kosmx.aoc23.springs.SetsKt$subsets$2<T> extends kotlin.coroutines.jvm.internal.ContinuationImpl {\n java.lang.Object L$0;\n\n java.lang.Object L$1;\n\n j... |
KosmX__advent-of-code23__ad01ab8/src/main/kotlin/dev/kosmx/aoc23/cubes/Cubes.kt | package dev.kosmx.aoc23.cubes
import java.io.File
import kotlin.math.max
fun main() {
val games = File("cubes.txt").readLines().map { Game.of(it) }
println(games)
games.sumOf { game ->
val r = game.rounds.fold(Round()) { acc, round ->
Round(max(acc.red, round.red), max(acc.green, roun... | [
{
"class_path": "KosmX__advent-of-code23__ad01ab8/dev/kosmx/aoc23/cubes/CubesKt.class",
"javap": "Compiled from \"Cubes.kt\"\npublic final class dev.kosmx.aoc23.cubes.CubesKt {\n public static final void main();\n Code:\n 0: new #8 // class java/io/File\n 3: dup\n ... |
KosmX__advent-of-code23__ad01ab8/src/main/kotlin/dev/kosmx/aoc23/graphs/BFS.kt | package dev.kosmx.aoc23.graphs
import java.io.File
import java.util.PriorityQueue
operator fun List<String>.get(x: Int, y: Int): Char = this.getOrNull(y)?.getOrNull(x) ?: '.'
operator fun List<String>.get(xy: Pair<Int, Int>): Char = this[xy.first, xy.second]
operator fun List<String>.contains(xy: Pair<Int, Int>): B... | [
{
"class_path": "KosmX__advent-of-code23__ad01ab8/dev/kosmx/aoc23/graphs/BFSKt.class",
"javap": "Compiled from \"BFS.kt\"\npublic final class dev.kosmx.aoc23.graphs.BFSKt {\n private static final java.util.List<kotlin.Pair<java.lang.Integer, java.lang.Integer>> deltas;\n\n private static final java.util.M... |
Monkey-Maestro__earcut-kotlin-multiplatform__51396cd/src/commonMain/kotlin/urbanistic.transform/AnyToXY.kt | package urbanistic.transform
import kotlin.math.sqrt
class Point3(var x: Double = 0.0, var y: Double = 0.0, var z: Double = 0.0) {
fun set(x: Double, y: Double, z: Double) {
this.x = x
this.y = y
this.z = z
}
operator fun minus(v2: Point3): Point3 {
return Point3(x - v2.x,... | [
{
"class_path": "Monkey-Maestro__earcut-kotlin-multiplatform__51396cd/urbanistic/transform/AnyToXYKt.class",
"javap": "Compiled from \"AnyToXY.kt\"\npublic final class urbanistic.transform.AnyToXYKt {\n public static final double[] normal(double[]);\n Code:\n 0: aload_0\n 1: ldc #9... |
CokeLee777__algorithm__919d623/src/main/kotlin/shortestpath/전보.kt | package shortestpath
import java.util.*
import kotlin.math.*
private const val INF = 1e9.toInt()
fun main(){
val sc = Scanner(System.`in`)
val n = sc.nextInt()
val m = sc.nextInt()
val start = sc.nextInt()
//최단거리 테이블 초기화
val distances = IntArray(n + 1) { INF }
//그래프 초기화
val graph = m... | [
{
"class_path": "CokeLee777__algorithm__919d623/shortestpath/전보Kt.class",
"javap": "Compiled from \"전보.kt\"\npublic final class shortestpath.전보Kt {\n private static final int INF;\n\n public static final void main();\n Code:\n 0: new #8 // class java/util/Scanner\n ... |
CokeLee777__algorithm__919d623/src/main/kotlin/shortestpath/개선된_다익스트라_알고리즘.kt | package shortestpath
import java.util.*
import kotlin.Comparator
import kotlin.math.*
private const val INF = 1e9.toInt()
fun main(){
val sc = Scanner(System.`in`)
//노드의 개수와 간선의 개수 입력받기
val n = sc.nextInt()
val m = sc.nextInt()
//시작노드 번호 입력받기
val start = sc.nextInt()
//최단거리 테이블 초기화
va... | [
{
"class_path": "CokeLee777__algorithm__919d623/shortestpath/개선된_다익스트라_알고리즘Kt.class",
"javap": "Compiled from \"개선된_다익스트라_알고리즘.kt\"\npublic final class shortestpath.개선된_다익스트라_알고리즘Kt {\n private static final int INF;\n\n public static final void main();\n Code:\n 0: new #8 ... |
CokeLee777__algorithm__919d623/src/main/kotlin/dfsbfs/특정_거리의_도시_찾기.kt | package dfsbfs
import java.util.*
import kotlin.math.*
fun main(){
val sc = Scanner(System.`in`)
val n = sc.nextInt() //도시의 개수
val m = sc.nextInt() //도로의 개수
val k = sc.nextInt() //거리 정보
val x = sc.nextInt() //출발 도시의 번호
//최단거리 테이블 초기화
val distances = IntArray(n + 1) { 1e9.toInt... | [
{
"class_path": "CokeLee777__algorithm__919d623/dfsbfs/특정_거리의_도시_찾기Kt.class",
"javap": "Compiled from \"특정_거리의_도시_찾기.kt\"\npublic final class dfsbfs.특정_거리의_도시_찾기Kt {\n public static final void main();\n Code:\n 0: new #8 // class java/util/Scanner\n 3: dup\n ... |
daniilsjb__advent-of-code-2021__bcdd709/src/main/kotlin/day09/Day09.kt | package day09
import java.io.File
fun main() {
val data = parse("src/main/kotlin/day09/Day09.txt")
val answer1 = part1(data.toHeightmap())
val answer2 = part2(data.toHeightmap())
println("🎄 Day 09 🎄")
println()
println("[Part 1]")
println("Answer: $answer1")
println()
print... | [
{
"class_path": "daniilsjb__advent-of-code-2021__bcdd709/day09/Day09Kt.class",
"javap": "Compiled from \"Day09.kt\"\npublic final class day09.Day09Kt {\n public static final void main();\n Code:\n 0: ldc #8 // String src/main/kotlin/day09/Day09.txt\n 2: invokestati... |
daniilsjb__advent-of-code-2021__bcdd709/src/main/kotlin/day08/Day08.kt | package day08
import java.io.File
fun main() {
val data = parse("src/main/kotlin/day08/Day08.txt")
val answer1 = part1(data)
val answer2 = part2(data)
println("🎄 Day 08 🎄")
println()
println("[Part 1]")
println("Answer: $answer1")
println()
println("[Part 2]")
println("... | [
{
"class_path": "daniilsjb__advent-of-code-2021__bcdd709/day08/Day08Kt.class",
"javap": "Compiled from \"Day08.kt\"\npublic final class day08.Day08Kt {\n public static final void main();\n Code:\n 0: ldc #8 // String src/main/kotlin/day08/Day08.txt\n 2: invokestati... |
daniilsjb__advent-of-code-2021__bcdd709/src/main/kotlin/day12/Day12.kt | package day12
import java.io.File
fun main() {
val data = parse("src/main/kotlin/day12/Day12.txt")
val answer1 = part1(data)
val answer2 = part2(data)
println("🎄 Day 12 🎄")
println()
println("[Part 1]")
println("Answer: $answer1")
println()
println("[Part 2]")
println("... | [
{
"class_path": "daniilsjb__advent-of-code-2021__bcdd709/day12/Day12Kt.class",
"javap": "Compiled from \"Day12.kt\"\npublic final class day12.Day12Kt {\n public static final void main();\n Code:\n 0: ldc #8 // String src/main/kotlin/day12/Day12.txt\n 2: invokestati... |
daniilsjb__advent-of-code-2021__bcdd709/src/main/kotlin/day15/Day15.kt | package day15
import java.io.File
import java.util.*
fun main() {
val data = parse("src/main/kotlin/day15/Day15.txt")
val answer1 = part1(data)
val answer2 = part2(data)
println("🎄 Day 15 🎄")
println()
println("[Part 1]")
println("Answer: $answer1")
println()
println("[Part... | [
{
"class_path": "daniilsjb__advent-of-code-2021__bcdd709/day15/Day15Kt.class",
"javap": "Compiled from \"Day15.kt\"\npublic final class day15.Day15Kt {\n public static final void main();\n Code:\n 0: ldc #8 // String src/main/kotlin/day15/Day15.txt\n 2: invokestati... |
daniilsjb__advent-of-code-2021__bcdd709/src/main/kotlin/day14/Day14.kt | package day14
import java.io.File
fun main() {
val (template, rules) = parse("src/main/kotlin/day14/Day14.txt")
val answer1 = part1(template, rules)
val answer2 = part2(template, rules)
println("🎄 Day 14 🎄")
println()
println("[Part 1]")
println("Answer: $answer1")
println()
... | [
{
"class_path": "daniilsjb__advent-of-code-2021__bcdd709/day14/Day14Kt$expand$1$3.class",
"javap": "Compiled from \"Day14.kt\"\nfinal class day14.Day14Kt$expand$1$3 extends kotlin.jvm.internal.FunctionReferenceImpl implements kotlin.jvm.functions.Function2<java.lang.Long, java.lang.Long, java.lang.Long> {\n... |
daniilsjb__advent-of-code-2021__bcdd709/src/main/kotlin/day13/Day13.kt | package day13
import java.io.File
import kotlin.math.abs
fun main() {
val (points, folds) = parse("src/main/kotlin/day13/Day13.txt")
val answer1 = part1(points, folds)
val answer2 = part2(points, folds)
println("🎄 Day 13 🎄")
println()
println("[Part 1]")
println("Answer: $answer1")
... | [
{
"class_path": "daniilsjb__advent-of-code-2021__bcdd709/day13/Day13Kt$WhenMappings.class",
"javap": "Compiled from \"Day13.kt\"\npublic final class day13.Day13Kt$WhenMappings {\n public static final int[] $EnumSwitchMapping$0;\n\n static {};\n Code:\n 0: invokestatic #14 // Meth... |
daniilsjb__advent-of-code-2021__bcdd709/src/main/kotlin/day25/Day25.kt | package day25
import java.io.File
fun main() {
val data = parse("src/main/kotlin/day25/Day25.txt")
val answer = solve(data)
println("🎄 Day 25 🎄")
println("Answer: $answer")
}
private data class Area(
val width: Int,
val height: Int,
val cells: List<Char>,
)
private fun Area.getIndex(... | [
{
"class_path": "daniilsjb__advent-of-code-2021__bcdd709/day25/Day25Kt.class",
"javap": "Compiled from \"Day25.kt\"\npublic final class day25.Day25Kt {\n public static final void main();\n Code:\n 0: ldc #8 // String src/main/kotlin/day25/Day25.txt\n 2: invokestati... |
daniilsjb__advent-of-code-2021__bcdd709/src/main/kotlin/day22/Day22.kt | package day22
import java.io.File
import kotlin.math.max
import kotlin.math.min
fun main() {
val data = parse("src/main/kotlin/day22/Day22.txt")
val answer1 = part1(data)
val answer2 = part2(data)
println("🎄 Day 22 🎄")
println()
println("[Part 1]")
println("Answer: $answer1")
pr... | [
{
"class_path": "daniilsjb__advent-of-code-2021__bcdd709/day22/Day22Kt.class",
"javap": "Compiled from \"Day22.kt\"\npublic final class day22.Day22Kt {\n public static final void main();\n Code:\n 0: ldc #8 // String src/main/kotlin/day22/Day22.txt\n 2: invokestati... |
daniilsjb__advent-of-code-2021__bcdd709/src/main/kotlin/day04/Day04.kt | package day04
import java.io.File
fun main() {
val (numbers, boards) = parse("src/main/kotlin/day04/Day04.txt")
val answer1 = part1(numbers, boards.map(List<Int>::toMutableList))
val answer2 = part2(numbers, boards.map(List<Int>::toMutableList))
println("🎄 Day 04 🎄")
println()
println("[... | [
{
"class_path": "daniilsjb__advent-of-code-2021__bcdd709/day04/Day04Kt.class",
"javap": "Compiled from \"Day04.kt\"\npublic final class day04.Day04Kt {\n public static final void main();\n Code:\n 0: ldc #8 // String src/main/kotlin/day04/Day04.txt\n 2: invokestati... |
daniilsjb__advent-of-code-2021__bcdd709/src/main/kotlin/day03/Day03.kt | package day03
import java.io.File
fun main() {
val data = parse("src/main/kotlin/day03/Day03.txt")
val answer1 = part1(data)
val answer2 = part2(data)
println("🎄 Day 03 🎄")
println()
println("[Part 1]")
println("Answer: $answer1")
println()
println("[Part 2]")
println("... | [
{
"class_path": "daniilsjb__advent-of-code-2021__bcdd709/day03/Day03Kt.class",
"javap": "Compiled from \"Day03.kt\"\npublic final class day03.Day03Kt {\n public static final void main();\n Code:\n 0: ldc #8 // String src/main/kotlin/day03/Day03.txt\n 2: invokestati... |
daniilsjb__advent-of-code-2021__bcdd709/src/main/kotlin/day02/Day02.kt | package day02
import java.io.File
fun main() {
val data = parse("src/main/kotlin/day02/Day02.txt")
val answer1 = part1(data)
val answer2 = part2(data)
println("🎄 Day 02 🎄")
println()
println("[Part 1]")
println("Answer: $answer1")
println()
println("[Part 2]")
println("... | [
{
"class_path": "daniilsjb__advent-of-code-2021__bcdd709/day02/Day02Kt.class",
"javap": "Compiled from \"Day02.kt\"\npublic final class day02.Day02Kt {\n public static final void main();\n Code:\n 0: ldc #8 // String src/main/kotlin/day02/Day02.txt\n 2: invokestati... |
daniilsjb__advent-of-code-2021__bcdd709/src/main/kotlin/day05/Day05.kt | package day05
import java.io.File
import kotlin.math.min
import kotlin.math.max
fun main() {
val data = parse("src/main/kotlin/day05/Day05.txt")
val answer1 = part1(data)
val answer2 = part2(data)
println("🎄 Day 05 🎄")
println()
println("[Part 1]")
println("Answer: $answer1")
pr... | [
{
"class_path": "daniilsjb__advent-of-code-2021__bcdd709/day05/Day05Kt$part1$$inlined$groupingBy$1.class",
"javap": "Compiled from \"_Sequences.kt\"\npublic final class day05.Day05Kt$part1$$inlined$groupingBy$1 implements kotlin.collections.Grouping<day05.Point, day05.Point> {\n final kotlin.sequences.Sequ... |
daniilsjb__advent-of-code-2021__bcdd709/src/main/kotlin/day20/Day20.kt | package day20
import java.io.File
fun main() {
val data = parse("src/main/kotlin/day20/Day20.txt")
val answer1 = part1(data)
val answer2 = part2(data)
println("🎄 Day 20 🎄")
println()
println("[Part 1]")
println("Answer: $answer1")
println()
println("[Part 2]")
println("... | [
{
"class_path": "daniilsjb__advent-of-code-2021__bcdd709/day20/Day20Kt.class",
"javap": "Compiled from \"Day20.kt\"\npublic final class day20.Day20Kt {\n public static final void main();\n Code:\n 0: ldc #8 // String src/main/kotlin/day20/Day20.txt\n 2: invokestati... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.