kt_path stringlengths 35 167 | kt_source stringlengths 626 28.9k | classes listlengths 1 17 |
|---|---|---|
austin226__codeforces-kt__4377021/contest1907/src/main/kotlin/C.kt | import kotlin.math.min
// https://codeforces.com/contest/1907/problem/C
private fun readInt(): Int = readln().toInt()
private fun solve(n: Int, s: String): Int {
var min = n
val checked = mutableSetOf(s)
val q = ArrayDeque<String>()
q.addFirst(s)
while (q.isNotEmpty()) {
val str = q.remove... | [
{
"class_path": "austin226__codeforces-kt__4377021/CKt.class",
"javap": "Compiled from \"C.kt\"\npublic final class CKt {\n private static final int readInt();\n Code:\n 0: invokestatic #12 // Method kotlin/io/ConsoleKt.readln:()Ljava/lang/String;\n 3: invokestatic #18 ... |
austin226__codeforces-kt__4377021/codeforces/src/main/kotlin/contest1911/H.kt | // https://codeforces.com/contest/1911/problem/H
private fun String.splitWhitespace() = split("\\s+".toRegex())
private fun <T> List<T>.counts(): Map<T, Int> = this.groupingBy { it }.eachCount()
private fun <T : Comparable<T>> List<T>.isStrictlyDecreasing(): Boolean =
(size <= 1) || (1 until size).all { i -> get(... | [
{
"class_path": "austin226__codeforces-kt__4377021/HKt.class",
"javap": "Compiled from \"H.kt\"\npublic final class HKt {\n private static final java.util.List<java.lang.String> splitWhitespace(java.lang.String);\n Code:\n 0: aload_0\n 1: checkcast #9 // class java/lang/... |
austin226__codeforces-kt__4377021/codeforces/src/main/kotlin/contest1911/F.kt | // https://codeforces.com/contest/1911/problem/F
private fun String.splitWhitespace() = split("\\s+".toRegex())
private fun <T> List<T>.counts(): Map<T, Int> = this.groupingBy { it }.eachCount()
fun idealUniqueWeights(weights: List<Int>): Set<Int> {
val uniqueWeights = mutableSetOf<Int>()
for (weight in weig... | [
{
"class_path": "austin226__codeforces-kt__4377021/FKt$counts$$inlined$groupingBy$1.class",
"javap": "Compiled from \"_Collections.kt\"\npublic final class FKt$counts$$inlined$groupingBy$1 implements kotlin.collections.Grouping<T, T> {\n final java.lang.Iterable $this_groupingBy;\n\n public FKt$counts$$in... |
austin226__codeforces-kt__4377021/codeforces/src/main/kotlin/contest1911/e.kt | import java.util.*
private fun String.splitWhitespace() = split("\\s+".toRegex())
fun greatestPowerUpTo(n: Int): Int? {
if (n < 1) {
return null
}
var p = 1
while (p < n) {
if (p * 2 > n) {
return p
}
p *= 2
}
return p
}
fun asPower2Sum(n: Int, k: I... | [
{
"class_path": "austin226__codeforces-kt__4377021/EKt.class",
"javap": "Compiled from \"e.kt\"\npublic final class EKt {\n private static final java.util.List<java.lang.String> splitWhitespace(java.lang.String);\n Code:\n 0: aload_0\n 1: checkcast #9 // class java/lang/... |
austin226__codeforces-kt__4377021/contest1907/src/main/kotlin/CFixed.kt | import kotlin.streams.toList
// https://codeforces.com/contest/1907/problem/C
private fun readInt(): Int = readln().toInt()
private fun <T> List<T>.counts(): Map<T, Int> = this.groupingBy { it }.eachCount()
private fun solve(n: Int, s: String): Int {
// https://codeforces.com/blog/entry/123012
// The final st... | [
{
"class_path": "austin226__codeforces-kt__4377021/CFixedKt$counts$$inlined$groupingBy$1.class",
"javap": "Compiled from \"_Collections.kt\"\npublic final class CFixedKt$counts$$inlined$groupingBy$1 implements kotlin.collections.Grouping<T, T> {\n final java.lang.Iterable $this_groupingBy;\n\n public CFix... |
austin226__codeforces-kt__4377021/contest1907/src/main/kotlin/D.kt | import kotlin.math.max
import kotlin.math.min
// https://codeforces.com/contest/1907/problem/D
private fun String.splitWhitespace() = split("\\s+".toRegex())
private fun readInt(): Int = readln().toInt()
private fun readInts(): List<Int> = readln().splitWhitespace().map { it.toInt() }
private fun testK(segments: Lis... | [
{
"class_path": "austin226__codeforces-kt__4377021/DKt.class",
"javap": "Compiled from \"D.kt\"\npublic final class DKt {\n private static final java.util.List<java.lang.String> splitWhitespace(java.lang.String);\n Code:\n 0: aload_0\n 1: checkcast #9 // class java/lang/... |
austin226__codeforces-kt__4377021/codeforces/src/main/kotlin/contest1911/G.kt | import java.math.BigInteger
private fun String.splitWhitespace() = split("\\s+".toRegex())
// s1 and s2 both have the same length
fun averageString(s1: String, s2: String, len: Int): String {
// // Work backwards from the end
// val avgStrChars = MutableList<Char>(len) { '?' }
// var remainder = 0
// for ... | [
{
"class_path": "austin226__codeforces-kt__4377021/GKt.class",
"javap": "Compiled from \"G.kt\"\npublic final class GKt {\n private static final java.util.List<java.lang.String> splitWhitespace(java.lang.String);\n Code:\n 0: aload_0\n 1: checkcast #9 // class java/lang/... |
er453r__aoc2022__9f98e24/src/Day24.kt | fun main() {
val directions = mapOf('<' to Vector3d.LEFT, '>' to Vector3d.RIGHT, '^' to Vector3d.UP, 'v' to Vector3d.DOWN)
val neighboursInTime = directions.values.map { it + Vector3d.BACK }.toSet() + Vector3d.BACK
val start = Vector3d(0, -1, 0)
fun isEmpty(positionInTime: Vector3d, width: Int, height:... | [
{
"class_path": "er453r__aoc2022__9f98e24/Day24Kt$main$1.class",
"javap": "Compiled from \"Day24.kt\"\nfinal class Day24Kt$main$1 extends kotlin.jvm.internal.FunctionReferenceImpl implements kotlin.jvm.functions.Function1<java.util.List<? extends java.lang.String>, java.lang.Integer> {\n final Vector3d $st... |
er453r__aoc2022__9f98e24/src/Utils.kt | import java.io.File
import java.math.BigInteger
import kotlin.math.abs
import kotlin.math.max
fun readInput(name: String) = File("aoc2022/src", "$name.txt")
.readLines()
fun <T> assertEquals(value: T, target: T) {
if (value != target)
check(false) { "Expected $target got $value" }
}
fun String.destru... | [
{
"class_path": "er453r__aoc2022__9f98e24/UtilsKt.class",
"javap": "Compiled from \"Utils.kt\"\npublic final class UtilsKt {\n private static final kotlin.text.Regex intLineRegex;\n\n public static final java.util.List<java.lang.String> readInput(java.lang.String);\n Code:\n 0: aload_0\n 1:... |
er453r__aoc2022__9f98e24/src/Day14.kt | fun main() {
fun fallingSand(input: List<String>, hardFloor: Boolean, stopOnOverflow: Boolean, startPoint: Vector2d = Vector2d(500, 0)): Int {
val lines = input.map {
it.ints().chunked(2).map { (x, y) ->
Vector2d(x, y)
}.toList()
}
val xMin = lines.fl... | [
{
"class_path": "er453r__aoc2022__9f98e24/Day14Kt.class",
"javap": "Compiled from \"Day14.kt\"\npublic final class Day14Kt {\n public static final void main();\n Code:\n 0: bipush 14\n 2: bipush 24\n 4: invokestatic #12 // Method java/lang/Integer.valueOf... |
er453r__aoc2022__9f98e24/src/Day04.kt | fun main() {
val inputLineRegex = """\d""".toRegex()
fun lineToSets(line: String): Pair<Set<Int>, Set<Int>> {
val (start1, end1, start2, end2) = inputLineRegex.findAll(line).map { it.value.toInt() }.toList()
return Pair((start1..end1).toSet(), (start2..end2).toSet())
}
fun part1(input... | [
{
"class_path": "er453r__aoc2022__9f98e24/Day04Kt.class",
"javap": "Compiled from \"Day04.kt\"\npublic final class Day04Kt {\n public static final void main();\n Code:\n 0: new #8 // class kotlin/text/Regex\n 3: dup\n 4: ldc #10 // S... |
er453r__aoc2022__9f98e24/src/Day22.kt | fun main() {
val instructionLineRegex = """(\d+|\w)""".toRegex()
val rightTurns = arrayOf(Vector2d.RIGHT, Vector2d.DOWN, Vector2d.LEFT, Vector2d.UP)
val leftTurns = arrayOf(Vector2d.RIGHT, Vector2d.UP, Vector2d.LEFT, Vector2d.DOWN)
fun part1(input: List<String>): Int {
val instructions = instru... | [
{
"class_path": "er453r__aoc2022__9f98e24/Day22Kt.class",
"javap": "Compiled from \"Day22.kt\"\npublic final class Day22Kt {\n public static final void main();\n Code:\n 0: new #8 // class kotlin/text/Regex\n 3: dup\n 4: ldc #10 // S... |
er453r__aoc2022__9f98e24/src/Day23.kt | fun main() {
val directionsToConsider = arrayOf(
arrayOf(
Vector2d.UP,
Vector2d.UP + Vector2d.LEFT,
Vector2d.UP + Vector2d.RIGHT,
),
arrayOf(
Vector2d.DOWN,
Vector2d.DOWN + Vector2d.LEFT,
Vector2d.DOWN + Vector2d.RIGHT,
... | [
{
"class_path": "er453r__aoc2022__9f98e24/Day23Kt$main$1.class",
"javap": "Compiled from \"Day23.kt\"\nfinal class Day23Kt$main$1 extends kotlin.jvm.internal.FunctionReferenceImpl implements kotlin.jvm.functions.Function1<java.util.List<? extends java.lang.String>, java.lang.Integer> {\n final Vector2d[][]... |
er453r__aoc2022__9f98e24/src/Day20.kt | import kotlin.math.absoluteValue
fun main() {
class Wrapper(val value: Long)
fun mix(originalOrder:List<Wrapper>, mixed:MutableList<Wrapper>){
// println(mixed.map { it.value })
for (entry in originalOrder) {
val entryPositionInMixed = mixed.indexOf(entry)
mixed.remove... | [
{
"class_path": "er453r__aoc2022__9f98e24/Day20Kt$main$2.class",
"javap": "Compiled from \"Day20.kt\"\nfinal class Day20Kt$main$2 extends kotlin.jvm.internal.FunctionReferenceImpl implements kotlin.jvm.functions.Function1<java.util.List<? extends java.lang.String>, java.lang.Long> {\n public static final D... |
er453r__aoc2022__9f98e24/src/Day21.kt | fun main() {
class Monkey(val name: String, var value: Long?, val operation: String) {
fun yell(monkeys: Map<String, Monkey>): Long = if (value != null)
value!!
else {
val (name1, operator, name2) = operation.split(" ")
val monkey1 = monkeys[name1]!!.yell(monkeys)... | [
{
"class_path": "er453r__aoc2022__9f98e24/Day21Kt$main$2.class",
"javap": "Compiled from \"Day21.kt\"\nfinal class Day21Kt$main$2 extends kotlin.jvm.internal.FunctionReferenceImpl implements kotlin.jvm.functions.Function1<java.util.List<? extends java.lang.String>, java.lang.Long> {\n public static final D... |
er453r__aoc2022__9f98e24/src/Day07.kt | fun main() {
abstract class FileSystem {
abstract fun size(): Int
}
data class Directory(val path: String, val parent: Directory? = null) : FileSystem() {
val files = mutableMapOf<String, FileSystem>()
override fun size() = files.values.sumOf { it.size() }
}
data class File... | [
{
"class_path": "er453r__aoc2022__9f98e24/Day07Kt$main$FileSystem.class",
"javap": "Compiled from \"Day07.kt\"\npublic abstract class Day07Kt$main$FileSystem {\n public Day07Kt$main$FileSystem();\n Code:\n 0: aload_0\n 1: invokespecial #8 // Method java/lang/Object.\"<init>\... |
er453r__aoc2022__9f98e24/src/Day25.kt | fun main() {
val charToDigit = mapOf('=' to -2, '-' to -1, '0' to 0, '1' to 1, '2' to 2)
val digitToChar = charToDigit.map { (char, digit) -> digit.toLong() to char }.toMap()
fun toDecimal(snafu: String) = snafu.toCharArray().reversed().mapIndexed { index, char -> charToDigit[char]!! * 5.pow(index) }.sum()... | [
{
"class_path": "er453r__aoc2022__9f98e24/Day25Kt$main$1.class",
"javap": "Compiled from \"Day25.kt\"\nfinal class Day25Kt$main$1 extends kotlin.jvm.internal.FunctionReferenceImpl implements kotlin.jvm.functions.Function1<java.util.List<? extends java.lang.String>, java.lang.String> {\n final java.util.Map... |
er453r__aoc2022__9f98e24/src/Day05.kt | fun main() {
val inputLineRegex = """move (\d+) from (\d+) to (\d+)""".toRegex()
fun partX(input: List<String>, moveLogic: (List<ArrayDeque<Char>>, Int, Int, Int) -> Unit): String {
val stacks = List(9) { ArrayDeque<Char>() }
for (line in input) {
if (line.contains('[')) {
... | [
{
"class_path": "er453r__aoc2022__9f98e24/Day05Kt.class",
"javap": "Compiled from \"Day05.kt\"\npublic final class Day05Kt {\n public static final void main();\n Code:\n 0: new #8 // class kotlin/text/Regex\n 3: dup\n 4: ldc #10 // S... |
er453r__aoc2022__9f98e24/src/Day15.kt | import kotlin.math.max
import kotlin.math.min
fun main() {
fun parseData(input: List<String>): List<Triple<Vector2d, Vector2d, Int>> = input.map { line ->
line.ints().let {
val sensor = Vector2d(it[0], it[1])
val beacon = Vector2d(it[2], it[3])
val range = (sensor - beac... | [
{
"class_path": "er453r__aoc2022__9f98e24/Day15Kt.class",
"javap": "Compiled from \"Day15.kt\"\npublic final class Day15Kt {\n public static final void main();\n Code:\n 0: bipush 15\n 2: ldc2_w #7 // long 26l\n 5: invokestatic #14 // Met... |
er453r__aoc2022__9f98e24/src/Day17.kt | import kotlin.math.min
fun main() {
val blockShapes = """####
.#.
###
.#.
..#
..#
###
#
#
#
#
##
##"""
class Block(val points: List<Vector2d>) {
fun move(vector2d: Vector2d) = points.forEach { it.increment(vector2d) }
fun collides(other: Set<Vector2d>) = points.any { it in other }
... | [
{
"class_path": "er453r__aoc2022__9f98e24/Day17Kt$main$Block.class",
"javap": "Compiled from \"Day17.kt\"\npublic final class Day17Kt$main$Block {\n private final java.util.List<Vector2d> points;\n\n public Day17Kt$main$Block(java.util.List<Vector2d>);\n Code:\n 0: aload_1\n 1: ldc ... |
er453r__aoc2022__9f98e24/src/Day16.kt | fun main() {
class Node(val rate: Int, var paths: List<Node> = emptyList())
val inputLineRegex = """Valve ([A-Z]+) has flow rate=(\d+)""".toRegex()
val input2LineRegex = """([A-Z]+)""".toRegex()
fun parseData(input: List<String>): Map<String, Node> {
val nodes = mutableMapOf<String, Node>()
... | [
{
"class_path": "er453r__aoc2022__9f98e24/Day16Kt$main$Node.class",
"javap": "Compiled from \"Day16.kt\"\npublic final class Day16Kt$main$Node {\n private final int rate;\n\n private java.util.List<Day16Kt$main$Node> paths;\n\n public Day16Kt$main$Node(int, java.util.List<Day16Kt$main$Node>);\n Code:\... |
er453r__aoc2022__9f98e24/src/Day11.kt | fun main() {
data class Monkey(
val id: Int,
val items: ArrayDeque<Long>,
val operation: Char,
val operationParam: String,
val testParam: Int,
val onSuccessTarget: Int,
val onFailedTarget: Int,
)
val inputLineRegex = """\d+""".toRegex()
fun monke... | [
{
"class_path": "er453r__aoc2022__9f98e24/Day11Kt$main$Monkey.class",
"javap": "Compiled from \"Day11.kt\"\npublic final class Day11Kt$main$Monkey {\n private final int id;\n\n private final kotlin.collections.ArrayDeque<java.lang.Long> items;\n\n private final char operation;\n\n private final java.lan... |
er453r__aoc2022__9f98e24/src/Day19.kt | import java.lang.Integer.max
fun main() {
fun part1(input: List<String>): Int {
val blueprints = input.map { line ->
line.ints().let {
listOf(
VectorN(it[1], 0, 0, 0),
VectorN(it[2], 0, 0, 0),
VectorN(it[3], it[4], 0, 0... | [
{
"class_path": "er453r__aoc2022__9f98e24/Day19Kt$main$2.class",
"javap": "Compiled from \"Day19.kt\"\nfinal class Day19Kt$main$2 extends kotlin.jvm.internal.FunctionReferenceImpl implements kotlin.jvm.functions.Function1<java.util.List<? extends java.lang.String>, java.lang.Integer> {\n public static fina... |
er453r__aoc2022__9f98e24/src/Day12.kt | fun main() {
val aCode = 'a'.code
val (startCode, endCode) = arrayOf('S'.code - aCode, 'E'.code - aCode)
fun neighbours(cell: GridCell<Int>, grid: Grid<Int>) = grid.crossNeighbours(cell.position).filter {
it.value < cell.value + 2
}
fun prepareData(input: List<String>): Triple<Grid<Int>, G... | [
{
"class_path": "er453r__aoc2022__9f98e24/Day12Kt$main$1.class",
"javap": "Compiled from \"Day12.kt\"\nfinal class Day12Kt$main$1 extends kotlin.jvm.internal.FunctionReferenceImpl implements kotlin.jvm.functions.Function1<java.util.List<? extends java.lang.String>, java.lang.Integer> {\n final int $aCode;\... |
er453r__aoc2022__9f98e24/src/Day13.kt | fun main() {
data class ListOrValue(val value: Int? = null, val list: List<ListOrValue>? = null)
fun parseLine(line: String): ListOrValue = when {
line.startsWith("[") -> { // find the end
val list = mutableListOf<ListOrValue>()
var stackSize = 0
var accumulator = ""... | [
{
"class_path": "er453r__aoc2022__9f98e24/Day13Kt.class",
"javap": "Compiled from \"Day13.kt\"\npublic final class Day13Kt {\n public static final void main();\n Code:\n 0: iconst_2\n 1: anewarray #8 // class java/lang/String\n 4: astore_1\n 5: aload_1\n ... |
er453r__aoc2022__9f98e24/src/Day03.kt | fun main() {
val lowerScoreOffset = 'a'.code - 1
val upperScoreOffset = 'A'.code - 1 - 26
fun Char.priority(): Int = this.code - (if (this.code > lowerScoreOffset) lowerScoreOffset else upperScoreOffset)
fun part1(input: List<String>): Int = input.sumOf { items ->
items.chunked(items.length / ... | [
{
"class_path": "er453r__aoc2022__9f98e24/Day03Kt.class",
"javap": "Compiled from \"Day03.kt\"\npublic final class Day03Kt {\n public static final void main();\n Code:\n 0: bipush 96\n 2: istore_0\n 3: bipush 38\n 5: istore_1\n 6: iconst_3\n 7: sipush ... |
er453r__aoc2022__9f98e24/src/Day08.kt | fun main() {
fun part1(input: List<String>): Int {
val grid = Grid(input.map { it.toCharArray().asList().map(Char::digitToInt) })
val outside = 2 * grid.width + 2 * (grid.height - 2)
var otherVisible = 0
for (x in 1 until grid.width - 1)
for (y in 1 until grid.height - ... | [
{
"class_path": "er453r__aoc2022__9f98e24/Day08Kt$main$1.class",
"javap": "Compiled from \"Day08.kt\"\nfinal class Day08Kt$main$1 extends kotlin.jvm.internal.FunctionReferenceImpl implements kotlin.jvm.functions.Function1<java.util.List<? extends java.lang.String>, java.lang.Integer> {\n public static fina... |
er453r__aoc2022__9f98e24/src/Day09.kt | fun main() {
fun ropeTailTravel(input: List<String>, ropeLength: Int): Int {
val knots = Array(ropeLength) { Vector2d(0, 0) }
val visited = mutableSetOf(knots.last())
for (command in input) {
val (direction, steps) = command.split(" ")
repeat(steps.toInt()) {
... | [
{
"class_path": "er453r__aoc2022__9f98e24/Day09Kt$main$1.class",
"javap": "Compiled from \"Day09.kt\"\nfinal class Day09Kt$main$1 extends kotlin.jvm.internal.FunctionReferenceImpl implements kotlin.jvm.functions.Function1<java.util.List<? extends java.lang.String>, java.lang.Integer> {\n public static fina... |
er453r__aoc2022__9f98e24/src/Day18.kt | fun main() {
fun part1(input: List<String>): Int {
val occupied = input.map { it.ints() }.map { (x, y, z) -> Vector3d(x, y, z) }.toSet()
return occupied.sumOf { cube -> 6 - Vector3d.DIRECTIONS.count { dir -> cube + dir in occupied } }
}
fun part2(input: List<String>): Int {
val occ... | [
{
"class_path": "er453r__aoc2022__9f98e24/Day18Kt$main$2.class",
"javap": "Compiled from \"Day18.kt\"\nfinal class Day18Kt$main$2 extends kotlin.jvm.internal.FunctionReferenceImpl implements kotlin.jvm.functions.Function1<java.util.List<? extends java.lang.String>, java.lang.Integer> {\n public static fina... |
tucuxi__leetcode-make-a-large-island__b44a1d3/src/main/kotlin/Solution.kt | class Solution {
fun largestIsland(grid: Array<IntArray>): Int {
val n = grid.size
val firstLabel = 2
val sizes = mutableMapOf<Int, Int>()
fun label(row: Int, col: Int): Int =
if (row !in 0 until n || col !in 0 until n) 0 else grid[row][col]
fun conquerIsland(la... | [
{
"class_path": "tucuxi__leetcode-make-a-large-island__b44a1d3/Solution.class",
"javap": "Compiled from \"Solution.kt\"\npublic final class Solution {\n public static final Solution$Companion Companion;\n\n private static final kotlin.Pair<java.lang.Integer, java.lang.Integer>[] steps;\n\n public Solutio... |
csabapap__aoc-2017__c1cca8f/src/main/kotlin/Day02.kt | object Day02 {
fun part1(input: String): Int {
var sum = 0
input.lines().forEach({ line ->
var min = 0
var max = 0
line.split("\\s+".toRegex()).forEach {
val number = it.toInt()
if (min == 0 || min > number) {
m... | [
{
"class_path": "csabapap__aoc-2017__c1cca8f/Day02.class",
"javap": "Compiled from \"Day02.kt\"\npublic final class Day02 {\n public static final Day02 INSTANCE;\n\n private Day02();\n Code:\n 0: aload_0\n 1: invokespecial #8 // Method java/lang/Object.\"<init>\":()V\n ... |
ikr__exercism__37f5054/kotlin/roman-numerals/src/main/kotlin/RomanNumeral.kt | object RomanNumeral {
fun value(x: Int): String {
val result = StringBuilder()
var remainder = x
while (remainder > 0) {
val next = firstNotExceeding(remainder)
result.append(next.literal)
remainder -= next.value
}
return result.toString(... | [
{
"class_path": "ikr__exercism__37f5054/RomanNumeral.class",
"javap": "Compiled from \"RomanNumeral.kt\"\npublic final class RomanNumeral {\n public static final RomanNumeral INSTANCE;\n\n private RomanNumeral();\n Code:\n 0: aload_0\n 1: invokespecial #8 // Method java/lan... |
ikr__exercism__37f5054/kotlin/largest-series-product/src/main/kotlin/Series.kt | data class Series(val s: String) {
init {
require(Regex("^[0-9]*$") matches s)
}
fun getLargestProduct(length: Int): Int {
require(length <= s.length)
val subSeqs = s.split("0").filter {it != ""}
val subSolutions = subSeqs.map {largestProductOfNonZeroes(digits(it), length)}... | [
{
"class_path": "ikr__exercism__37f5054/Series.class",
"javap": "Compiled from \"Series.kt\"\npublic final class Series {\n private final java.lang.String s;\n\n public Series(java.lang.String);\n Code:\n 0: aload_1\n 1: ldc #9 // String s\n 3: invokestatic ... |
kmakma__advent-of-kotlin-2022__950ffbc/src/Utils.kt | import java.io.File
import java.math.BigInteger
import java.security.MessageDigest
import kotlin.math.abs
typealias Vector2D = Coord2D
/**
* Reads lines from the given input txt file.
*/
fun readInput(name: String) = File("src", "$name.txt")
.readLines()
/**
* Read whole input txt file as one string.
*/
fun ... | [
{
"class_path": "kmakma__advent-of-kotlin-2022__950ffbc/UtilsKt.class",
"javap": "Compiled from \"Utils.kt\"\npublic final class UtilsKt {\n public static final java.util.List<java.lang.String> readInput(java.lang.String);\n Code:\n 0: aload_0\n 1: ldc #10 // String... |
kmakma__advent-of-kotlin-2022__950ffbc/src/Day04.kt | fun main() {
fun part1(input: List<List<Int>>): Int {
return input.count { list ->
(list[0] <= list[2] && list[1] >= list[3])
|| (list[0] >= list[2] && list[1] <= list[3])
}
}
fun part2(input: List<List<Int>>): Int {
return input.count { list ->
... | [
{
"class_path": "kmakma__advent-of-kotlin-2022__950ffbc/Day04Kt.class",
"javap": "Compiled from \"Day04.kt\"\npublic final class Day04Kt {\n public static final void main();\n Code:\n 0: ldc #8 // String Day04\n 2: invokestatic #14 // Method UtilsK... |
kmakma__advent-of-kotlin-2022__950ffbc/src/Day15.kt | import kotlin.math.abs
fun main() {
data class Interval(var start: Int, var end: Int) {
fun limit(minStart: Int, maxEnd: Int) {
start = maxOf(minStart, start)
end = minOf(maxEnd, end)
}
fun size(): Int {
return 1 + end - start
}
}
fun L... | [
{
"class_path": "kmakma__advent-of-kotlin-2022__950ffbc/Day15Kt$main$Interval.class",
"javap": "Compiled from \"Day15.kt\"\npublic final class Day15Kt$main$Interval {\n private int start;\n\n private int end;\n\n public Day15Kt$main$Interval(int, int);\n Code:\n 0: aload_0\n 1: invokespeci... |
kmakma__advent-of-kotlin-2022__950ffbc/src/Day05.kt | fun main() {
data class Move(val count: Int, val source: Int, val target: Int)
class CrateStacks(input: List<String>) {
val stacks = mutableMapOf<Int, ArrayDeque<Char>>()
val moves = mutableListOf<Move>()
init {
var parseMoves = false
input.forEach { line ->
... | [
{
"class_path": "kmakma__advent-of-kotlin-2022__950ffbc/Day05Kt$main$Move.class",
"javap": "Compiled from \"Day05.kt\"\npublic final class Day05Kt$main$Move {\n private final int count;\n\n private final int source;\n\n private final int target;\n\n public Day05Kt$main$Move(int, int, int);\n Code:\n ... |
kmakma__advent-of-kotlin-2022__950ffbc/src/Day09.kt | fun main() {
val oneX = Coord2D(1, 0)
val oneY = Coord2D(0, 1)
data class Motion(val dir: Char, val count: Int)
fun mapToMotions(input: List<String>): List<Motion> {
return input.map {
val (d, c) = it.split(" ")
Motion(d.first(), c.toInt())
}
}
fun move... | [
{
"class_path": "kmakma__advent-of-kotlin-2022__950ffbc/Day09Kt$main$Motion.class",
"javap": "Compiled from \"Day09.kt\"\npublic final class Day09Kt$main$Motion {\n private final char dir;\n\n private final int count;\n\n public Day09Kt$main$Motion(char, int);\n Code:\n 0: aload_0\n 1: inv... |
kmakma__advent-of-kotlin-2022__950ffbc/src/Day07.kt | fun main() {
fun buildFileSystem(input: List<String>): Directory {
val root = Directory(null, "/")
var currentDir: Directory = root
val iter = input.iterator()
while (iter.hasNext()) {
val line = iter.next()
when {
line == "$ cd /" -> current... | [
{
"class_path": "kmakma__advent-of-kotlin-2022__950ffbc/Day07Kt.class",
"javap": "Compiled from \"Day07.kt\"\npublic final class Day07Kt {\n public static final void main();\n Code:\n 0: ldc #8 // String Day07\n 2: invokestatic #14 // Method UtilsK... |
kmakma__advent-of-kotlin-2022__950ffbc/src/Day03.kt | fun main() {
fun Char.priority(): Int {
return this.code - if (this.isLowerCase()) 96 else 38
}
fun part1(input: List<String>): Int {
var prioSum = 0
input.forEach { line ->
val chunked = line.chunked(line.length / 2)
val duplicate = chunked[0].toSet().inter... | [
{
"class_path": "kmakma__advent-of-kotlin-2022__950ffbc/Day03Kt.class",
"javap": "Compiled from \"Day03.kt\"\npublic final class Day03Kt {\n public static final void main();\n Code:\n 0: ldc #8 // String Day03\n 2: invokestatic #14 // Method UtilsK... |
kmakma__advent-of-kotlin-2022__950ffbc/src/Day10.kt | fun main() {
/**
* cathode-ray tube screen and simple CPU
*/
class CRT {
var cycle = 0
var register = 1
var row = mutableListOf<Char>()
fun exec(op: String) {
doCycle()
if ("noop" == op) return
doCycle()
register += op.s... | [
{
"class_path": "kmakma__advent-of-kotlin-2022__950ffbc/Day10Kt$main$CRT.class",
"javap": "Compiled from \"Day10.kt\"\npublic final class Day10Kt$main$CRT {\n private int cycle;\n\n private int register;\n\n private java.util.List<java.lang.Character> row;\n\n public Day10Kt$main$CRT();\n Code:\n ... |
kmakma__advent-of-kotlin-2022__950ffbc/src/Day02.kt | fun main() {
fun myScore(strategy: String): Int {
return when {
strategy.contains('X') -> 1
strategy.contains('Y') -> 2
strategy.contains('Z') -> 3
else -> throw IllegalArgumentException()
}
}
fun part1(input: List<String>): Int {
val ... | [
{
"class_path": "kmakma__advent-of-kotlin-2022__950ffbc/Day02Kt.class",
"javap": "Compiled from \"Day02.kt\"\npublic final class Day02Kt {\n public static final void main();\n Code:\n 0: ldc #8 // String Day02\n 2: invokestatic #14 // Method UtilsK... |
kmakma__advent-of-kotlin-2022__950ffbc/src/Day12.kt | fun main() {
fun neighborsOf(coord: Coord2D, map: Map<Coord2D, Int>): List<Coord2D> {
val neighbors = mutableListOf<Coord2D>()
if (coord.x > 0) {
val newCoord = coord.moved(-1, 0)
if (map[newCoord]!! - map[coord]!! <= 1) neighbors.add(newCoord)
}
if (coord.y ... | [
{
"class_path": "kmakma__advent-of-kotlin-2022__950ffbc/Day12Kt.class",
"javap": "Compiled from \"Day12.kt\"\npublic final class Day12Kt {\n public static final void main();\n Code:\n 0: ldc #8 // String Day12\n 2: invokestatic #14 // Method UtilsK... |
kmakma__advent-of-kotlin-2022__950ffbc/src/Day08.kt | import kotlin.math.max
fun main() {
fun part1(input: List<String>): Int {
val visible = mutableSetOf<Coord2D>()
val grid = input.map { line -> line.map { it.digitToInt() } }
val lastX = grid.lastIndex
val lastY = grid.first().lastIndex
visible.addAll(grid.indices.map { Coor... | [
{
"class_path": "kmakma__advent-of-kotlin-2022__950ffbc/Day08Kt.class",
"javap": "Compiled from \"Day08.kt\"\npublic final class Day08Kt {\n public static final void main();\n Code:\n 0: ldc #8 // String Day08\n 2: invokestatic #14 // Method UtilsK... |
AlBovo__Compiti__56a3131/src/main/kotlin/numberFraction.kt | class NumberFraction(var numerator: Int, denominatorValue: Int){
var denominator = denominatorValue
set(value){
require(value != 0){
"The denominator must be different from 0"
}
field = value
}
init{
require(denominatorValue != ... | [
{
"class_path": "AlBovo__Compiti__56a3131/NumberFraction.class",
"javap": "Compiled from \"numberFraction.kt\"\npublic final class NumberFraction {\n private int numerator;\n\n private int denominator;\n\n public NumberFraction(int, int);\n Code:\n 0: aload_0\n 1: invokespecial #9 ... |
AlBovo__Compiti__56a3131/src/main/kotlin/segtree.kt | import kotlin.math.*
class SegmentTree(array: Array<Int>){
private var segment = Array<Int>(0){ 0 }
private var size = 0
private var sizeOfInitialArray = 0
init{
size = 1 shl ceil(log2(array.size.toFloat())).toInt()
sizeOfInitialArray = array.size
segment = Array(size * 2){ 0 }... | [
{
"class_path": "AlBovo__Compiti__56a3131/SegtreeKt.class",
"javap": "Compiled from \"segtree.kt\"\npublic final class SegtreeKt {\n public static final void main();\n Code:\n 0: bipush 7\n 2: anewarray #8 // class java/lang/Integer\n 5: astore_1\n 6: ... |
DmitrySwan__KotlinEducation__83dbf8b/src/Tasks.kt | fun main() {
println(
repeatedIntersection(intArrayOf(3, 6, 7, 8, 7, 9), mutableListOf(12, 6, 7, 6, 7, 565))
)
println(countLetters("AAGGDDDFBBBAAABB"))
println(groupWords(arrayOf("ate", "tdb", "eat", "ref", "fer", "test")))
}
fun repeatedIntersection(array1: IntArray, array2: MutableList<Int>)... | [
{
"class_path": "DmitrySwan__KotlinEducation__83dbf8b/TasksKt.class",
"javap": "Compiled from \"Tasks.kt\"\npublic final class TasksKt {\n public static final void main();\n Code:\n 0: bipush 6\n 2: newarray int\n 4: astore_0\n 5: aload_0\n 6: iconst_0\n ... |
UlrichBerntien__Uebungen-Kotlin__0b4c608/KameleBeladen.kt | /**
* Programmieraufgabe:
*
* Kamele beladen
* https://www.programmieraufgaben.ch/aufgabe/kamele-beladen/6gddr4zm
*
* Ein Kamel soll optimal beladen werden. Das Kamel kann maximal 270 kg tragen.
* Aktuell sind Waren mit den folgenden Gewichten zu transportieren: 5, 18, 32,
* 34, 45, 57, 63, 69, 94, 98 und... | [
{
"class_path": "UlrichBerntien__Uebungen-Kotlin__0b4c608/KameleBeladenKt.class",
"javap": "Compiled from \"KameleBeladen.kt\"\npublic final class KameleBeladenKt {\n public static final int[] optimalLoad(int, int[]);\n Code:\n 0: aload_1\n 1: ldc #9 // String pool... |
mececeli__Kotlin_Exercises__d05ee9d/src/main/kotlin/ValidParenthese.kt | import java.util.*
//Valid Parentheses
//Easy
//16.9K
//871
//Companies
//Given a string s containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.
//
//An input string is valid if:
//
//Open brackets must be closed by the same type of brackets.
//Open brackets must be cl... | [
{
"class_path": "mececeli__Kotlin_Exercises__d05ee9d/ValidParentheseKt.class",
"javap": "Compiled from \"ValidParenthese.kt\"\npublic final class ValidParentheseKt {\n public static final boolean isValidParentheses(java.lang.String);\n Code:\n 0: aload_0\n 1: ldc #9 ... |
mececeli__Kotlin_Exercises__d05ee9d/src/main/kotlin/TwoSum.kt | /**
* Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target.
* You may assume that each input would have exactly one solution, and you may not use the same element twice.
* You can return the answer in any order.
*
* Example 1:
* Input: nums = [2... | [
{
"class_path": "mececeli__Kotlin_Exercises__d05ee9d/TwoSumKt.class",
"javap": "Compiled from \"TwoSum.kt\"\npublic final class TwoSumKt {\n public static final int[] twoSum(int[], int);\n Code:\n 0: aload_0\n 1: ldc #9 // String nums\n 3: invokestatic #15 ... |
duangsuse-valid-projects__Share__e89301b/Others/kt_misc/SortInclude.kt | typealias CategoryMap<K, V> = Set<Map<K, V>>
typealias IncludePath = String
/** Descending level */
typealias Level = /*Comparable*/ Int
class DescendAllocator(private var max: Int = Int.MAX_VALUE) {
fun less() = max--
}
val kmap: CategoryMap<IncludePath, Level> = DescendAllocator().run { setOf(
mapOf(
"QObje... | [
{
"class_path": "duangsuse-valid-projects__Share__e89301b/SortInclude.class",
"javap": "Compiled from \"SortInclude.kt\"\npublic final class SortInclude {\n public static final SortInclude INSTANCE;\n\n private static final kotlin.text.Regex includeRegex;\n\n private static final java.util.Map<java.lang.... |
US-ADDA__PI1_kotlin__b83e4fd/src/main/kotlin/Exercise3.kt | import java.util.stream.Stream
class Exercise3 {
companion object {
fun functional(start: Int, end: Int): List<Pair<Int, Int>> {
return Stream
.iterate(
Pair(0, start), // Cuando empieza.
{ it.first < end }, // Cuando termina.
... | [
{
"class_path": "US-ADDA__PI1_kotlin__b83e4fd/Exercise3$Companion$functional$$inlined$sortedBy$1.class",
"javap": "Compiled from \"Comparisons.kt\"\npublic final class Exercise3$Companion$functional$$inlined$sortedBy$1<T> implements java.util.Comparator {\n public Exercise3$Companion$functional$$inlined$so... |
US-ADDA__PI1_kotlin__b83e4fd/src/main/kotlin/Exercise4.kt | import java.util.stream.Stream
import kotlin.math.absoluteValue
import kotlin.math.pow
class Exercise4 {
companion object {
fun functional(n: Double, e: Double): Double {
val pair = Stream.iterate(
Pair(0.0, n) // Definimos el comienzo como 0 (nos dicen que se calcula la raíz c... | [
{
"class_path": "US-ADDA__PI1_kotlin__b83e4fd/Exercise4$Companion.class",
"javap": "Compiled from \"Exercise4.kt\"\npublic final class Exercise4$Companion {\n private Exercise4$Companion();\n Code:\n 0: aload_0\n 1: invokespecial #8 // Method java/lang/Object.\"<init>\":()V\... |
arukuka__software-for-SamurAI-Coding-2018-19__04db0da/player/greedy.kt | import java.util.*
import java.io.*
import kotlin.math.*
const val SEARCHDEPTH = 7
const val SPEEDLIMIT = 1000
const val searchDepth = SEARCHDEPTH
const val speedLimitSquared = SPEEDLIMIT * SPEEDLIMIT
var nextSeq = 1
data class IntVec(val x : Int, val y : Int) {
operator fun plus(v : IntVec) : IntVec {
return I... | [
{
"class_path": "arukuka__software-for-SamurAI-Coding-2018-19__04db0da/GreedyKt.class",
"javap": "Compiled from \"greedy.kt\"\npublic final class GreedyKt {\n public static final int SEARCHDEPTH;\n\n public static final int SPEEDLIMIT;\n\n public static final int searchDepth;\n\n public static final int... |
darian-catalin-cucer__divide-and-conquer-algorithms__1cea70d/kt.kt | fun quickSort(arr: IntArray, low: Int, high: Int) {
if (low < high) {
val pivotIndex = partition(arr, low, high)
quickSort(arr, low, pivotIndex - 1)
quickSort(arr, pivotIndex + 1, high)
}
}
fun partition(arr: IntArray, low: Int, high: Int): Int {
val pivot = arr[high]
var i = lo... | [
{
"class_path": "darian-catalin-cucer__divide-and-conquer-algorithms__1cea70d/KtKt.class",
"javap": "Compiled from \"kt.kt\"\npublic final class KtKt {\n public static final void quickSort(int[], int, int);\n Code:\n 0: aload_0\n 1: ldc #9 // String arr\n 3: ... |
sirech__exercism-kotlin__253f463/sublist/src/main/kotlin/Relationship.kt | enum class Relationship {
EQUAL, SUBLIST, SUPERLIST, UNEQUAL
}
private enum class Case {
EMPTY_CASE,
FIRST_BIGGER_OR_EQUAL,
FIRST_SMALLER
}
fun <T> List<T>.relationshipTo(other: List<T>): Relationship {
return when (case(this, other)) {
Case.EMPTY_CASE -> emptyCase(this, other)
C... | [
{
"class_path": "sirech__exercism-kotlin__253f463/RelationshipKt.class",
"javap": "Compiled from \"Relationship.kt\"\npublic final class RelationshipKt {\n public static final <T> Relationship relationshipTo(java.util.List<? extends T>, java.util.List<? extends T>);\n Code:\n 0: aload_0\n 1:... |
fasiha__advent-of-code-2020__59edfcb/aoc2020kot/src/main/kotlin/main.kt | import kotlin.math.PI
import kotlin.math.cos
import kotlin.math.roundToInt
import kotlin.math.sin
// From https://stackoverflow.com/a/53018129
fun getResourceAsText(path: String): String {
return object {}.javaClass.getResource(path)?.readText() ?: throw Exception("Unable to read file")
}
fun getResourceAsBytes(p... | [
{
"class_path": "fasiha__advent-of-code-2020__59edfcb/MainKt$problem10a$$inlined$groupingBy$1.class",
"javap": "Compiled from \"_Sequences.kt\"\npublic final class MainKt$problem10a$$inlined$groupingBy$1 implements kotlin.collections.Grouping<java.lang.Integer, java.lang.Integer> {\n final kotlin.sequences... |
nishtahir__scratchpad__51115e3/src/main/kotlin/Extensions.kt | import java.util.*
import java.util.concurrent.locks.Lock
fun isValidTriangle(values: List<Int>): Boolean =
values[0] + values[1] > values[2] &&
values[0] + values[2] > values[1] &&
values[1] + values[2] > values[0]
inline fun <reified T> List<T>.grouped(by: Int): List<List<T>>... | [
{
"class_path": "nishtahir__scratchpad__51115e3/ExtensionsKt.class",
"javap": "Compiled from \"Extensions.kt\"\npublic final class ExtensionsKt {\n public static final boolean isValidTriangle(java.util.List<java.lang.Integer>);\n Code:\n 0: aload_0\n 1: ldc #10 // S... |
rhavran__ProjectEuler__1115674/src/Utils.kt | import kotlin.math.sqrt
/**
* https://www.youtube.com/watch?v=V08g_lkKj6Q
*/
class EratosthenesSieve(n: Int) {
val numbers: List<Boolean>
init {
val numbersArray = BooleanArray(n + 1)
numbersArray.fill(true)
var potentialPrime = 2
while (potentialPrime * potentialPrime <= n)... | [
{
"class_path": "rhavran__ProjectEuler__1115674/UtilsKt.class",
"javap": "Compiled from \"Utils.kt\"\npublic final class UtilsKt {\n public static final long dividers(long);\n Code:\n 0: lconst_1\n 1: lstore_2\n 2: getstatic #12 // Field PrimeFactorization.INSTANCE:... |
rhavran__ProjectEuler__1115674/src/P14LongestCollatzSequence.kt | fun main(args: Array<String>) {
println("Res: " + findSolution())
}
/**
The following iterative sequence is defined for the set of positive integers:
n → n/2 (n is even)
n → 3n + 1 (n is odd)
Using the rule above and starting with 13, we generate the following sequence:
13 → 40 → 20 → 10 → 5 → 16 → 8 → 4 → 2 → ... | [
{
"class_path": "rhavran__ProjectEuler__1115674/P14LongestCollatzSequenceKt.class",
"javap": "Compiled from \"P14LongestCollatzSequence.kt\"\npublic final class P14LongestCollatzSequenceKt {\n public static final void main(java.lang.String[]);\n Code:\n 0: aload_0\n 1: ldc #9 ... |
rhavran__ProjectEuler__1115674/src/P12HighlyDivisibleTriangularNumber.kt | fun main(args: Array<String>) {
println("Res: " + findSolution())
}
/**
The sequence of triangle numbers is generated by adding the natural numbers. So the 7th triangle number would be 1 + 2 + 3 + 4 + 5 + 6 + 7 = 28. The first ten terms would be:
1, 3, 6, 10, 15, 21, 28, 36, 45, 55, ...
Let us list the factors o... | [
{
"class_path": "rhavran__ProjectEuler__1115674/P12HighlyDivisibleTriangularNumberKt.class",
"javap": "Compiled from \"P12HighlyDivisibleTriangularNumber.kt\"\npublic final class P12HighlyDivisibleTriangularNumberKt {\n public static final void main(java.lang.String[]);\n Code:\n 0: aload_0\n ... |
rhavran__ProjectEuler__1115674/src/P4LargersPalindromOf3Digits.kt | fun main(args: Array<String>) {
println("Res: " + largestLargestPalindromeProduct())
}
/**
* A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009 = 91 × 99.
* Find the largest palindrome made from the product of two 3-digit numbers.
*/
privat... | [
{
"class_path": "rhavran__ProjectEuler__1115674/P4LargersPalindromOf3DigitsKt.class",
"javap": "Compiled from \"P4LargersPalindromOf3Digits.kt\"\npublic final class P4LargersPalindromOf3DigitsKt {\n public static final void main(java.lang.String[]);\n Code:\n 0: aload_0\n 1: ldc #9... |
Mestru__Advent_of_Code_2017__2cc4211/src/main/kotlin/Day7.kt | import java.io.File
import kotlin.math.abs
data class Program(var weight: Int, var parent: String?, var children: List<String>?)
val programs = HashMap<String, Program>()
fun main(args: Array<String>) {
// part 1
val lineRegex = "(\\w+) \\((\\d+)\\)( -> )?(.+)?".toRegex()
var name: String
var weight... | [
{
"class_path": "Mestru__Advent_of_Code_2017__2cc4211/Day7Kt.class",
"javap": "Compiled from \"Day7.kt\"\npublic final class Day7Kt {\n private static final java.util.HashMap<java.lang.String, Program> programs;\n\n public static final java.util.HashMap<java.lang.String, Program> getPrograms();\n Code:... |
Mestru__Advent_of_Code_2017__2cc4211/src/main/kotlin/Day4.kt | import java.io.File
val letters = "abcdefghijklmnopqrstuvwxyz".toCharArray()
fun main(args: Array<String>) {
// part 1
var numberOfCorrectPassphrases = 0
File("input/day4.txt").forEachLine { line -> run {
if (passphraseIsValid(line)) numberOfCorrectPassphrases++
}
}
println(numberOfCo... | [
{
"class_path": "Mestru__Advent_of_Code_2017__2cc4211/Day4Kt.class",
"javap": "Compiled from \"Day4.kt\"\npublic final class Day4Kt {\n private static final char[] letters;\n\n public static final char[] getLetters();\n Code:\n 0: getstatic #11 // Field letters:[C\n 3: a... |
JoelEager__Kotlin-Collision-Detector__2c05f92/src/sat.kt | import kotlin.math.pow
class Vector(var x: Double, var y: Double)
/**
* @param poly1, poly2 The two polygons described as arrays of points as Vectors
* Note: The points list must go in sequence around the polygon
* @param maxDist The maximum distance between any two points of any two polygons that can be touching... | [
{
"class_path": "JoelEager__Kotlin-Collision-Detector__2c05f92/SatKt.class",
"javap": "Compiled from \"sat.kt\"\npublic final class SatKt {\n public static final boolean hasCollided(Vector[], Vector[], java.lang.Double);\n Code:\n 0: aload_0\n 1: ldc #10 // String p... |
darwineee__adventOfCode2023__c301358/src/main/kotlin/Day1.kt | import kotlin.io.path.Path
import kotlin.io.path.forEachLine
fun day1_part1(path: String) {
var result = 0
Path(path).forEachLine { line ->
val numLine = line.filter { it.isDigit() }
val num = when (numLine.length) {
1 -> numLine + numLine
2 -> numLine
else -... | [
{
"class_path": "darwineee__adventOfCode2023__c301358/Day1Kt.class",
"javap": "Compiled from \"Day1.kt\"\npublic final class Day1Kt {\n public static final void day1_part1(java.lang.String);\n Code:\n 0: aload_0\n 1: ldc #11 // String path\n 3: invokestatic #... |
leonhardbrenner__kitchensink__a7b9701/src/jvmMain/kotlin/Atom.kt | import java.util.*
val Pair<Int, Int>.a: Int get() = first
val Pair<Int, Int>.b: Int get() = second
fun <T, R> Sequence<T>.reductions(initial: R, operation: (acc: R, T) -> R) : Sequence<R> = sequence {
var last = initial
forEach {
last = operation(last, it)
yield(last)
}
}
class Atom(val ... | [
{
"class_path": "leonhardbrenner__kitchensink__a7b9701/AtomKt.class",
"javap": "Compiled from \"Atom.kt\"\npublic final class AtomKt {\n public static final int getA(kotlin.Pair<java.lang.Integer, java.lang.Integer>);\n Code:\n 0: aload_0\n 1: ldc #10 // String <thi... |
NicLeenknegt__kenze_exercise__11081ce/src/main/kotlin/Main.kt | import java.io.File
data class Matrix(
val matrix:Array<ArrayList<String>>,
var row:Int = 0,
var column:Int = 0
)
fun main(args: Array<String>) {
var words:Array<String> = splitStringByDelimiter(readFile("./input.txt"), "\n")
printStringArray(words)
var maxWordLength = words.map{ it:String -... | [
{
"class_path": "NicLeenknegt__kenze_exercise__11081ce/MainKt.class",
"javap": "Compiled from \"Main.kt\"\npublic final class MainKt {\n public static final void main(java.lang.String[]);\n Code:\n 0: aload_0\n 1: ldc #9 // String args\n 3: invokestatic #15 ... |
gardnerdickson__advent-of-code-2015__4a23ab3/src/day_2.kt | import java.io.File
import kotlin.streams.toList
fun main(args: Array<String>) {
val input = "res/day_2_input.txt"
val answer1 = Day2.part1(input)
println("Part 1: $answer1")
val answer2 = Day2.part2(input)
println("Part 2: $answer2")
}
object Day2 {
fun part1(input: String): Int {
v... | [
{
"class_path": "gardnerdickson__advent-of-code-2015__4a23ab3/Day_2Kt.class",
"javap": "Compiled from \"day_2.kt\"\npublic final class Day_2Kt {\n public static final void main(java.lang.String[]);\n Code:\n 0: aload_0\n 1: ldc #9 // String args\n 3: invokest... |
gardnerdickson__advent-of-code-2015__4a23ab3/src/day_3.kt | import java.io.File
fun main(args: Array<String>) {
val input = "res/day_3_input.txt"
val answer1 = Day3.part1(input)
println("Part 1: $answer1")
val answer2 = Day3.part2(input)
println("Part 2: $answer2")
}
object Day3 {
private enum class Turn {
SANTA, ROBO_SANTA;
fun nextT... | [
{
"class_path": "gardnerdickson__advent-of-code-2015__4a23ab3/Day_3Kt.class",
"javap": "Compiled from \"day_3.kt\"\npublic final class Day_3Kt {\n public static final void main(java.lang.String[]);\n Code:\n 0: aload_0\n 1: ldc #9 // String args\n 3: invokest... |
gardnerdickson__advent-of-code-2015__4a23ab3/src/day_10.kt | import java.lang.StringBuilder
fun main(args: Array<String>) {
val input = "1113222113"
val answer1 = Day10.part1(input)
println("Part 1: $answer1")
val answer2 = Day10.part2(input)
println("Part 2: $answer2")
}
object Day10 {
private fun lookAndSay(sequence: String): String {
val dig... | [
{
"class_path": "gardnerdickson__advent-of-code-2015__4a23ab3/Day_10Kt.class",
"javap": "Compiled from \"day_10.kt\"\npublic final class Day_10Kt {\n public static final void main(java.lang.String[]);\n Code:\n 0: aload_0\n 1: ldc #9 // String args\n 3: invok... |
gardnerdickson__advent-of-code-2015__4a23ab3/src/day_7.kt | import java.io.File
import java.util.regex.Matcher
fun main(args: Array<String>) {
val filename = "res/day_7_input.txt"
val answer1 = Day7.part1(File(filename))
println("Part 1: $answer1")
val answer2 = Day7.part2(File(filename), answer1)
println("Part 2: $answer2")
}
object Day7 {
fun part1(... | [
{
"class_path": "gardnerdickson__advent-of-code-2015__4a23ab3/Day_7Kt.class",
"javap": "Compiled from \"day_7.kt\"\npublic final class Day_7Kt {\n public static final void main(java.lang.String[]);\n Code:\n 0: aload_0\n 1: ldc #9 // String args\n 3: invokest... |
darian-catalin-cucer__maximum-matching__db6b2b8/kt.kt | import java.util.*
fun maxMatching(n: Int, graph: Array<MutableList<Int>>): Int {
val matching = IntArray(n) { -1 }
val seen = BooleanArray(n)
fun dfs(i: Int): Boolean {
seen[i].also { seen[i] = true }
graph[i].forEach { j ->
if (matching[j] == -1 || (!seen[matching[j]] && dfs(m... | [
{
"class_path": "darian-catalin-cucer__maximum-matching__db6b2b8/KtKt.class",
"javap": "Compiled from \"kt.kt\"\npublic final class KtKt {\n public static final int maxMatching(int, java.util.List<java.lang.Integer>[]);\n Code:\n 0: aload_1\n 1: ldc #10 // String gr... |
luluvia__advent-of-code-22__29ddde3/src/main/kotlin/Day03.kt | class Day03 {
fun part1(input: List<String>): Int {
var priorityScore = 0
for (line in input) {
val matchingChar = getMatchingChar(line)
priorityScore += getPriorityScore(matchingChar)
}
return priorityScore
}
fun part2(input: List<String>): Int {
... | [
{
"class_path": "luluvia__advent-of-code-22__29ddde3/Day03.class",
"javap": "Compiled from \"Day03.kt\"\npublic final class Day03 {\n public Day03();\n Code:\n 0: aload_0\n 1: invokespecial #8 // Method java/lang/Object.\"<init>\":()V\n 4: return\n\n public final int ... |
luluvia__advent-of-code-22__29ddde3/src/main/kotlin/Day02.kt | class Day02 {
private val scores1 = mapOf(
'X' to mapOf('A' to 4, 'B' to 1, 'C' to 7),
'Y' to mapOf('A' to 8, 'B' to 5, 'C' to 2),
'Z' to mapOf('A' to 3, 'B' to 9, 'C' to 6)
)
private val scores2 = mapOf(
'X' to mapOf('A' to 3, 'B' to 1, 'C' to 2),
'Y' to mapOf('A' t... | [
{
"class_path": "luluvia__advent-of-code-22__29ddde3/Day02.class",
"javap": "Compiled from \"Day02.kt\"\npublic final class Day02 {\n private final java.util.Map<java.lang.Character, java.util.Map<java.lang.Character, java.lang.Integer>> scores1;\n\n private final java.util.Map<java.lang.Character, java.u... |
xfl03__DiscreteCourseWork__281042e/Matrix/Matrix.kt | /**
* 邻接矩阵
* 1 2 0 0
* 0 0 1 0
* 1 0 0 1
* 0 0 1 0
*/
val matrix = arrayOf(
"1200",
"0010",
"1001",
"0010"
)
/**
* 矩阵乘法
*/
fun multiply(a: Array<IntArray>, b: Array<IntArray>): Array<IntArray> {
val arr = Array(a.size) { IntArray(b[0].size) }
for (i in a.indices) {
... | [
{
"class_path": "xfl03__DiscreteCourseWork__281042e/MatrixKt.class",
"javap": "Compiled from \"Matrix.kt\"\npublic final class MatrixKt {\n private static final java.lang.String[] matrix;\n\n public static final java.lang.String[] getMatrix();\n Code:\n 0: getstatic #11 // Fie... |
mehran-naghizadeh__radix-sort__8b8bb34/radix_sort.kt | fun main() = unitTest()
fun radixSort(list: List<Int>): List<Int> {
val count = maxDigits(list)
var sorted = stringify(list)
for(i in 1..count) {
sorted = bucketize(sorted, count - i).flatten()
}
return sorted.map { it.toInt() }
}
fun bucketize(list: List<String>, position: Int): List<List<String>> {
... | [
{
"class_path": "mehran-naghizadeh__radix-sort__8b8bb34/Radix_sortKt.class",
"javap": "Compiled from \"radix_sort.kt\"\npublic final class Radix_sortKt {\n public static final void main();\n Code:\n 0: invokestatic #9 // Method unitTest:()V\n 3: return\n\n public static fi... |
fpeterek__Advent-Of-Code__d5bdf89/Day3/spiral_memory.kt | import kotlin.math.abs
import kotlin.math.ceil
import kotlin.math.sqrt
fun findNearestSquareRoot(num: Int): Int {
val nearestRoot = ceil(sqrt(num.toDouble())).toInt()
return if (nearestRoot % 2 == 0) {
nearestRoot + 1
} else {
nearestRoot
}
}
fun main(args: Array<String>) {
val... | [
{
"class_path": "fpeterek__Advent-Of-Code__d5bdf89/Spiral_memoryKt.class",
"javap": "Compiled from \"spiral_memory.kt\"\npublic final class Spiral_memoryKt {\n public static final int findNearestSquareRoot(int);\n Code:\n 0: iload_0\n 1: i2d\n 2: invokestatic #12 // Me... |
fpeterek__Advent-Of-Code__d5bdf89/Day6/memory_banks.kt | // Solves both first and second problem
fun redistribute(banks: MutableList<Int>) {
val max = banks.max()!!
var index = banks.indexOf(max)
var blocksToAlloc = max
banks[index] = 0
while (blocksToAlloc > 0) {
++index
if (index >= banks.size) {
index = 0
}
... | [
{
"class_path": "fpeterek__Advent-Of-Code__d5bdf89/Memory_banksKt.class",
"javap": "Compiled from \"memory_banks.kt\"\npublic final class Memory_banksKt {\n public static final void redistribute(java.util.List<java.lang.Integer>);\n Code:\n 0: aload_0\n 1: ldc #10 /... |
rfermontero__LalL-a-rLar__ca693f2/src/Parser.kt | fun parseGrammar(grammar: List<Pair<String, String>>) = getFirsts(grammar)
fun getFirsts(grammar: List<Pair<String, String>>): Map<String, List<String>> =
grammar.groupBy { it.first }
.mapValues { it.value.map { it.second } }
.mapValues {
it.value.map {
... | [
{
"class_path": "rfermontero__LalL-a-rLar__ca693f2/ParserKt.class",
"javap": "Compiled from \"Parser.kt\"\npublic final class ParserKt {\n public static final java.util.Map<java.lang.String, java.util.List<java.lang.String>> parseGrammar(java.util.List<kotlin.Pair<java.lang.String, java.lang.String>>);\n ... |
KonstantinLukaschenko__genetic-algorithm-kotlin__e282854/src/GeneticAlgorithm.kt | import java.lang.Math.random
/**
* Implementation of a basic genetic algorithm, that is capable to generate solutions for optimization and search
* problems relying on bio-inspired operations such as crossover, mutation and selection.
*
* @param T the type of an individual.
* @property population a collection of ... | [
{
"class_path": "KonstantinLukaschenko__genetic-algorithm-kotlin__e282854/GeneticAlgorithm$run$$inlined$sortedByDescending$2.class",
"javap": "Compiled from \"Comparisons.kt\"\npublic final class GeneticAlgorithm$run$$inlined$sortedByDescending$2<T> implements java.util.Comparator {\n public GeneticAlgorit... |
thalees__kotlin-code-challenges__3b499d2/9_nine/FallingBlocks.kt | import java.util.*
private class Block(val l: Int, val r: Int) : Comparable<Block> {
fun cover(c: Block) = l <= c.l && r >= c.r
override fun compareTo(other: Block): Int = l.compareTo(other.l)
}
fun main() {
val (n, d) = readLine()!!.split(" ").map { it.toInt() }
val bh = arrayOfNulls<TreeSet<Block>>(... | [
{
"class_path": "thalees__kotlin-code-challenges__3b499d2/FallingBlocksKt.class",
"javap": "Compiled from \"FallingBlocks.kt\"\npublic final class FallingBlocksKt {\n public static final void main();\n Code:\n 0: invokestatic #12 // Method kotlin/io/ConsoleKt.readLine:()Ljava/lang... |
thalees__kotlin-code-challenges__3b499d2/8_eight/PaintString.kt | fun main() {
class Ans(val a: String, val m: String)
repeat(readLine()!!.toInt()) {
val s = readLine()!!
val n = s.length
val dp = Array(n) { i -> arrayOfNulls<Ans>(i + 1) }
dp[0][0] = Ans(s.substring(0, 1), "R")
var best = Ans(s, "")
fun updateBest(p: Ans) {
... | [
{
"class_path": "thalees__kotlin-code-challenges__3b499d2/PaintStringKt$main$Ans.class",
"javap": "Compiled from \"PaintString.kt\"\npublic final class PaintStringKt$main$Ans {\n private final java.lang.String a;\n\n private final java.lang.String m;\n\n public PaintStringKt$main$Ans(java.lang.String, ja... |
thalees__kotlin-code-challenges__3b499d2/6_six/MovieFan.kt | import java.util.*
fun main() {
repeat(readLine()!!.toInt()) {
// readLine() // skip empty line
solveCase()
}
}
private data class Mv(val i: Int, val a: Int, val b: Int, var t: Int = 0) : Comparable<Mv> {
override fun compareTo(other: Mv): Int = if (b != other.b) b.compareTo(other.b) else i... | [
{
"class_path": "thalees__kotlin-code-challenges__3b499d2/MovieFanKt$solveCase$$inlined$sortBy$1.class",
"javap": "Compiled from \"Comparisons.kt\"\npublic final class MovieFanKt$solveCase$$inlined$sortBy$1<T> implements java.util.Comparator {\n public MovieFanKt$solveCase$$inlined$sortBy$1();\n Code:\n... |
thalees__kotlin-code-challenges__3b499d2/7_seven/MNumbers.kt | fun main() {
val (m, k) = readLine()!!.split(" ").map { it.toInt() }
val f = factor(m) ?: run {
println(-1)
return
}
val dp = HashMap<Long,Long>()
val dig = IntArray(100_000)
fun count(nd: Int, p: Long = -1): Long {
val e = f[0] + (f[1] shl 5) + (f[2] shl 10) + (f[3] shl ... | [
{
"class_path": "thalees__kotlin-code-challenges__3b499d2/MNumbersKt.class",
"javap": "Compiled from \"MNumbers.kt\"\npublic final class MNumbersKt {\n private static final java.util.List<java.lang.Integer> pr;\n\n private static final int[][] factors;\n\n public static final void main();\n Code:\n ... |
philipphofmann__coding-problems__db0889c/src/LongestUniqueSubSequence.kt | /**
* Returns the longest subsequence with unique character.
*/
fun longestUniqueSubSequence(value: String): String {
var longestUniqueSubSequence = ""
value.forEachIndexed { index, _ ->
val uniqueSubsequence = uniqueSubSequence(value.subSequence(index, value.length))
if (longestUniqueSubSeque... | [
{
"class_path": "philipphofmann__coding-problems__db0889c/LongestUniqueSubSequenceKt.class",
"javap": "Compiled from \"LongestUniqueSubSequence.kt\"\npublic final class LongestUniqueSubSequenceKt {\n public static final java.lang.String longestUniqueSubSequence(java.lang.String);\n Code:\n 0: aloa... |
philipphofmann__coding-problems__db0889c/src/Atoi.kt | /**
* Parses the string as an [Int] number and returns the result.
* See https://leetcode.com/problems/string-to-integer-atoi/
*
* @throws NumberFormatException if the string is not a valid representation of a number.
*/
fun atoi(string: String): Int {
val noWhitespaces = string.trim { it.isWhitespace() }
... | [
{
"class_path": "philipphofmann__coding-problems__db0889c/AtoiKt.class",
"javap": "Compiled from \"Atoi.kt\"\npublic final class AtoiKt {\n public static final int atoi(java.lang.String);\n Code:\n 0: aload_0\n 1: ldc #9 // String string\n 3: invokestatic #1... |
guilhermealbm__ManualFlashSettingsCalculator__74f049d/src/main/kotlin/CalculateAperture.kt | import java.lang.NumberFormatException
import kotlin.math.abs
val distances = listOf(1.2, 1.8, 2.5, 3.5, 5.0, 7.0)
val apertures = listOf(1.2, 1.4, 2, 2.8, 4, 5.6, 8, 11, 16, 22, 32, 45)
fun calculateAperture(iso_: String?, distance_: String?) : String {
val iso = convertIso(iso_)
val distance = convertDistan... | [
{
"class_path": "guilhermealbm__ManualFlashSettingsCalculator__74f049d/CalculateApertureKt.class",
"javap": "Compiled from \"CalculateAperture.kt\"\npublic final class CalculateApertureKt {\n private static final java.util.List<java.lang.Double> distances;\n\n private static final java.util.List<java.lang... |
charlottemach__adventofcode__dc83994/2021/five.kt | import java.io.File
import kotlin.math.abs
fun main() {
val input = File("five.txt").readText()
val coord = input.trim().split("\n").map{ it.split(" -> ")}
val mat = Array(1000) {Array(1000) {0} }
//val mat = Array(10) {Array(10) {0} }
for (c in coord) {
val start = c.first().split(","); va... | [
{
"class_path": "charlottemach__adventofcode__dc83994/FiveKt.class",
"javap": "Compiled from \"five.kt\"\npublic final class FiveKt {\n public static final void main();\n Code:\n 0: new #8 // class java/io/File\n 3: dup\n 4: ldc #10 ... |
charlottemach__adventofcode__dc83994/2023/11/eleven.kt | import java.io.File
import java.math.BigInteger
import java.util.Collections
fun main() {
val input = File("input.txt").readText()
println(cosmicExpansion(input,2))
println(cosmicExpansion(input,1000000))
}
fun cosmicExpansion(input: String, times: Int):BigInteger{
var lines = input.split("\n").dropLa... | [
{
"class_path": "charlottemach__adventofcode__dc83994/ElevenKt.class",
"javap": "Compiled from \"eleven.kt\"\npublic final class ElevenKt {\n public static final void main();\n Code:\n 0: new #8 // class java/io/File\n 3: dup\n 4: ldc #10 ... |
skrim__AdventOfCode__0e7f425/2021/19/program.kt | data class Coordinate(val x: Int, val y: Int, val z: Int) {
fun add(other: Coordinate) : Coordinate = Coordinate(x + other.x, y + other.y, z + other.z)
fun subtract(other: Coordinate) : Coordinate = Coordinate(x - other.x, y - other.y, z - other.z)
fun manhattanDistance(other: Coordinate) : Int = Math.abs... | [
{
"class_path": "skrim__AdventOfCode__0e7f425/ProgramKt.class",
"javap": "Compiled from \"program.kt\"\npublic final class ProgramKt {\n public static final void main();\n Code:\n 0: new #8 // class Program\n 3: dup\n 4: invokespecial #11 // M... |
A1rPun__nurture__295de6a/language/kotlin/fib.kt | import kotlin.math.pow
import kotlin.math.round
fun fib(n: Int): Int {
return if (n < 2) n else fib(n - 1) + fib(n - 2)
}
fun fibLinear(n: Int): Int {
var prevFib = 0
var fib = 1
repeat(n) {
val temp = prevFib + fib
prevFib = fib
fib = temp
}
return prevFib
}
fun fibFormula(n: Int): Int {
... | [
{
"class_path": "A1rPun__nurture__295de6a/FibKt.class",
"javap": "Compiled from \"fib.kt\"\npublic final class FibKt {\n public static final int fib(int);\n Code:\n 0: iload_0\n 1: iconst_2\n 2: if_icmpge 9\n 5: iload_0\n 6: goto 22\n 9: iload_0\n 10... |
a-red-christmas__aoc2017-kt__14e50f4/src/star05.kt | import java.lang.Math.abs
import java.lang.Math.pow
import kotlin.math.roundToInt
import kotlin.math.sqrt
fun main(args: Array<String>) {
println(findManhattanDistance(368078))
}
fun findManhattanDistance(start: Int) : Int {
val size = getSpiralArraySize(start)
val center = getSpiralArrayCenter(size) // q... | [
{
"class_path": "a-red-christmas__aoc2017-kt__14e50f4/Star05Kt.class",
"javap": "Compiled from \"star05.kt\"\npublic final class Star05Kt {\n public static final void main(java.lang.String[]);\n Code:\n 0: aload_0\n 1: ldc #9 // String args\n 3: invokestatic ... |
iproduct__course-kotlin__89884f8/03-problems-lab1/src/main/kotlin/Main.kt | import java.io.File
data class LongNumberProblem(
var n: Int,
var a: String,
var fm: List<Int>,
)
fun main(args: Array<String>) {
// read input
// val n = readLine()!!.toInt()
// val a = readLine()!!
// val fm = readLine()!!.split(" ").map { it.toInt() }
// read input from file
// Us... | [
{
"class_path": "iproduct__course-kotlin__89884f8/MainKt.class",
"javap": "Compiled from \"Main.kt\"\npublic final class MainKt {\n public static final void main(java.lang.String[]);\n Code:\n 0: aload_0\n 1: ldc #9 // String args\n 3: invokestatic #15 ... |
julianferres__Codeforces__14e8369/Kotlin Heroes 6 -Practice/G.kt | data class Edge(val from: Int, val to: Int, val cost: Long)
class DSU(val n: Int){
var par: MutableList<Int> = MutableList<Int>(n){ it }
var sz: MutableList<Int> = MutableList<Int>(n){ 1 }
fun find(x: Int): Int {
if(par[x] != x) par[x] = find(par[x])
return par[x]
}
fun join(i... | [
{
"class_path": "julianferres__Codeforces__14e8369/GKt$main$$inlined$compareBy$1.class",
"javap": "Compiled from \"Comparisons.kt\"\npublic final class GKt$main$$inlined$compareBy$1<T> implements java.util.Comparator {\n public GKt$main$$inlined$compareBy$1();\n Code:\n 0: aload_0\n 1: invok... |
charlesfranciscodev__codingame__3ec8060/puzzles/kotlin/src/war/war.kt | import java.util.Scanner
import kotlin.system.exitProcess
fun main(args : Array<String>) {
val game = Game()
game.play()
}
/**
* Represents the result of one game turn:
* PLAYER1 if player 1 wins this round,
* PLAYER2 if player 2 wins this round,
* WAR if the two cards played are of equal value
* */
enum cla... | [
{
"class_path": "charlesfranciscodev__codingame__3ec8060/WarKt.class",
"javap": "Compiled from \"war.kt\"\npublic final class WarKt {\n public static final void main(java.lang.String[]);\n Code:\n 0: aload_0\n 1: ldc #9 // String args\n 3: invokestatic #15 ... |
charlesfranciscodev__codingame__3ec8060/puzzles/kotlin/src/surface/surface.kt | import java.util.Scanner
import java.util.ArrayDeque
const val LAND = '#'
const val WATER = 'O'
const val DEFAULT_INDEX = -1
fun main(args : Array<String>) {
val grid = Grid()
grid.readGameInput()
grid.test()
}
data class Square(val x: Int, val y: Int, val terrain: Char, var lakeIndex: Int = DEFAULT_INDEX)
cl... | [
{
"class_path": "charlesfranciscodev__codingame__3ec8060/SurfaceKt.class",
"javap": "Compiled from \"surface.kt\"\npublic final class SurfaceKt {\n public static final char LAND;\n\n public static final char WATER;\n\n public static final int DEFAULT_INDEX;\n\n public static final void main(java.lang.St... |
marc-bouvier-katas__Kotlin_EduTools_Advent_of_Code_2021__12cf74c/Day 5/Part 1/src/Task.kt | fun overlaps(ventsLines: Array<String>): Int {
val lines = Lines()
return if (ventsLines.size >= 2) {
repeat(ventsLines.size){
lines.mergeWith(Line.fromLineOfVent(LineOfVent.fromString(ventsLines[it])))
}
return lines.overlaps()
} else 0
}
data class Lines(private val dat... | [
{
"class_path": "marc-bouvier-katas__Kotlin_EduTools_Advent_of_Code_2021__12cf74c/TaskKt.class",
"javap": "Compiled from \"Task.kt\"\npublic final class TaskKt {\n public static final int overlaps(java.lang.String[]);\n Code:\n 0: aload_0\n 1: ldc #9 // String vent... |
occmundial__Kotlin-Weekly-Challenge__f09ba0a/src/Challenge2.kt | /*
* Challenge #2
*
* Date: 15/08/2022
* Difficulty: Medium
* Create a function that translate from natural text to Morse code and vice versa.
* - Must be automatically detect what type it is and perform the conversion.
* - In Morse, dash "—", dot ".", a space " " between letters or symbols, and two spaces between word... | [
{
"class_path": "occmundial__Kotlin-Weekly-Challenge__f09ba0a/Challenge2Kt.class",
"javap": "Compiled from \"Challenge2.kt\"\npublic final class Challenge2Kt {\n public static java.util.Map<java.lang.String, java.lang.String> naturalDictionary;\n\n private static java.util.Map<java.lang.String, java.lang.... |
sviams__aoc23__4914a54/src/main/kotlin/day2.kt | object day2 {
data class DrawSet(val red: Int, val green: Int, val blue: Int)
data class Game(val id: Int, val sets: List<DrawSet>) {
val power: Int by lazy { sets.maxOf { it.red } * sets.maxOf { it.blue } * sets.maxOf { it.green } }
fun withinLimit(r: Int, b: Int, g: Int): Boolean = sets.all {... | [
{
"class_path": "sviams__aoc23__4914a54/day2$DrawSet.class",
"javap": "Compiled from \"day2.kt\"\npublic final class day2$DrawSet {\n private final int red;\n\n private final int green;\n\n private final int blue;\n\n public day2$DrawSet(int, int, int);\n Code:\n 0: aload_0\n 1: invokespe... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.